学步园

递归方法

int BinSearch(int Array[],int low,int high,int key/*要找的值*/)<br /> {<br /> if (low<=high)<br /> {<br /> int mid = (low+high)/2;<br /> if(key == Array[mid])<br /> return mid;<br /> else if(key<Array[mid])<br /> return BinSearch(Array,low,mid-1,key);<br /> else if(key>Array[mid])<br /> return BinSearch(Array,mid+1,high,key);<br /> }<br /> else<br /> return -1;<br /> }

非递归方法

int BinSearch(int Array[],int SizeOfArray,int key/*要找的值*/)<br /> {<br /> int low=0,high=SizeOfArray-1;<br /> int mid;<br /> while (low<=high)<br /> {<br /> mid = (low+high)/2;<br /> if(key==Array[mid])<br /> return mid;<br /> if(key<Array[mid])<br /> high=mid-1;<br /> if(key>Array[mid])<br /> low=mid+1;<br /> }<br /> return -1;<br /> }