|
1. The Beginning
이번 숙제에서 구현해야 하는 bubble sort, binary search에 대해서 먼저 C 코드로 작성한 후 그를 바탕으로 MIPS 어셈블리 코드를 만들었습니다. 처음에는 gcc –S 로 80x86용 어셈블리 코드를 만들고 그를 MIPS 어셈블리 코드로 변환해 보
|
|
|
assemblers use "credible commitments" such as financial assistance, technological assistance, and managerial assistance. The coefficient of specific human capital is positive and significant. This suggests that assemblers search for another means to control the problems of opportunism in the case of
|
|
|
|
#include<stdio.h>
#include<stdlib.h>
typedef struct tree_node *tree_pointer;
typedef struct tree_node {
int Key;
tree_pointer left;
tree_pointer right;
}tree_node;
void insertToBT(tree_pointer *ptr, int num) ;
tree_pointer binary_search(tree_pointer ptr, int key);
void inOrderT
|
|
|
|
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define TRUE 1
#define FALSE 0
typedef struct BST {
int data;
struct BST *left;
struct BST *right;
} BST;
BST *make_node();
BST *init_BST(int);
int insert_BST(BST *, int);
int search
|
|
|
;
}
else if (array[middle]> value)
last = middle -1;
else first = middle +1;
}
return position;
}
|
|
메뉴펼치기
