学步园

1. 二分查找法

int BinSearch(int a[], int n, int K)<br /> {<br /> int low=0,high=n-1,mid;//置当前查找区间上、下界的初值</p> <p> while(low <= high)<br /> { //当前查找区间R[low..high]非空<br /> mid = (low+high)/2;<br /> if(a[mid] == K)<br /> return mid; //查找成功返回<br /> if(a[mid] > K)<br /> high = mid-1; //继续在R[low..mid-1]中查找<br /> else<br /> low = mid+1; //继续在R[mid+1..high]中查找<br /> }<br /> return 0; //当low>high时表示查找区间为空，查找失败<br /> } //BinSeareh