摘要： 二分查找，按从小到大排序int BinarySearch(int a[],int x,int n){ int low=0;int high=n-1; while(low>1;//防止溢出，移位更高效 if(x==a[middle])return middle; if(x>a[middle])low=middle+1; else high=middle-1; } return -1;//元素未找到}　递归版本：int BinSearch(int Array[],int low,int high,int key/*要找的值*/) { if (low>1; ... 阅读全文