//三次比较的二分搜索,前提是数组元素已经是有序的 int BinarySearch(int arry[], int searchnum,int length){ int low = 0; int high = length - 1; int mid; while(low<=high){ mid = (low+high)/2; if(arry[mid]<searchnum){ low = mid+1; }else if(arry[mid]>searchnum){ high = mid-1; }else{ printf("find the search number,the index is:%d",mid); return mid; } } printf("sorry,can't find the num!"); return 1; }