搜索算法总结

1. 二分查找法

 

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