C语言 冒泡排序和二分查找

 

#include <unistd.h>#include <stdio.h>int a[] = {11,2,3,44,58,16,7,8,9,10};//冒泡排序int order_main(){        int i,j;        int n = sizeof(a)/sizeof(int);        int tmp;        for(i=n-1;i>0;i--)                for(j=0;j<i;j++)                        if(a[j] > a[j+1])                        {       tmp = a[j+1];                                a[j+1] = a[j];                                a[j] = tmp;                        }        for(i=0;i<n;i++)                printf("%d\t",a[i]);        printf("\n");}//二分查找int search_main(int obj){        int s=0,m,l=sizeof(a)/sizeof(int);        while(s<=l) {                m = (s+l)/2;                if(a[m]==obj) {                        printf("the index is %d\n",m);                        return;                }                else if(a[m]<obj) s = m+1;                else l = m-1;        }        printf("cannot find %d!\n",obj);}int main(){        order_main();        search_main(3);        search_main(99);}