6.12編寫查找和排序函數(shù)

1、本節(jié)主題：編寫查找和排序函數(shù)回顧：有序表中的二分查找#include #define SIZE 10 int main( )int dSIZE = 1, 3, 9, 12, 32, 41, 45, 62, 75, 77;int low, high,mid,key,index=-1; printf(Input a key you want to search: ); scanf(%d , &key);low=0,high=SIZE-1; while(lowkey) high=mid-1;elselow=mid+1;if(index = 0)printf(The index of the key

2、is %d .n, index);elseprintf(Not found.n); return 0;d0d1d2d3d4d5d6d7d8d913912324162757782用函數(shù)實(shí)現(xiàn)二分查找/*功能：在長度為n的有序數(shù)組中查找k出現(xiàn)的位置*/int binary_search(int arr, int n, int k)int i=-1;int low=0,high=n-1,mid; while(lowk) high=mid-1;elselow=mid+1;return i;#include int binary_search(int arr, int n, int k);#define

3、SIZE 10int main( )int dSIZE = 1,3,9,12,32,41,45,62,75,77;int key,index;printf(Input a key you want to search: );scanf(%d , &key);index = binary_search(d, SIZE, key);if(index = 0)printf(The index is %d .n, index);elseprintf(Not found.n);return 0;d0 d1 d2 d3 d4 d5 d6 d7 d8 d913912324162757782用選擇法排序(升序

4、) 選擇法：先找出N個數(shù)中最小的數(shù)，與a0對換;再找出a1到aN-1中最 小的數(shù)，與a1對換。每比較一輪,找出一個未經(jīng)排序的數(shù)中最小的一 個，并置于未排序部分的開始處。一共需要比較N-1輪。a0a1a2a3a4排序任務(wù)36194未排序時163945數(shù)中最小數(shù)1（a2），k=2，交換a2和a013694余下數(shù)中最小數(shù)3（a2）, k=2，交換a2和a113496余下數(shù)中最小數(shù)4（a4）, k=4，交換a4和a213469余下數(shù)中最小數(shù)6（a4）, k=4，交換a4和a336194#include void select_sort(int array,int n);int main( )int a10= 4,3,7,9,1,5,0,8,2,6,i;select_sort(a,10);printf(the sorted array：n); for(i=0; i10; i+)printf(%d , ai); printf(n);return 0;用函數(shù)實(shí)現(xiàn)選擇法算法k=i;for(j=i+1; jn; j+) if(arrayjarrayk)k=j;t=arrayk;arrayk=arrayi; arrayi=t;return;void select_sort(i