《C语言二分法查找代码.doc》由会员分享，可在线阅读，更多相关《C语言二分法查找代码.doc（3页珍藏版）》请在三一文库上搜索。
1、Test2:#include #include #include #define N 20struct data *data_init(void);void data_out(struct data *data_head);void data_exchange(struct data *a, struct data *b);void bubble_sort(struct data *data_head);int data_find_fisrt_to_end(int data, int toFind);struct data int value;struct data *next;/main f
2、unctionvoid main(void) struct data *data_head;int toFind;data_head = data_init();bubble_sort(data_head);data_out(data_head);printf(please type a int to find in this seriesn);scanf(%d, &toFind);if(!data_find_first_to_end(data_head, toFind) printf(sorry the int %d is not foundn, toFind);/data init fun
3、ctionstruct data *data_init(void) struct data *head, *p, *q;int i;head = (struct data *)malloc(sizeof(struct data);head-next = NULL;p = head;for(i = 0; i value = rand() % 100;q-next = NULL;p-next = q;p = q;return head;/data outputvoid data_out(struct data *data_head) struct data *p;printf(this chain
4、 is:);for(p = data_head; p-next != NULL;) p = p-next; if(p != data_head-next) printf(-);printf(%d, p-value); printf(n);/data bubble sort min - maxvoid bubble_sort(struct data *data_head) struct data *p, *q;for(p = data_head-next; p-next != NULL; p = p-next) for(q = p-next; q-next != NULL; ) q = q-ne
5、xt;if(p-value q-value) data_exchange(p, q);/data exchangevoid data_exchange(struct data *a, struct data *b) int temp;temp = a-value;a-value = b-value;b-value = temp;/data find data is mix - maxint data_find_first_to_end(struct data *data_head, int toFind) struct data *p;int order = 0;p = data_head;while(p-next != NULL) p = p-next;if(toFind = p-value) printf(the position of %d in this chain is %d (from 0 - %d)n, toFind, order, N -1);return 1;order +;return 0;