//二分查找法
public class BinarySearch {
public static int binarySearch(int[] list,int key)
{
int low=0;
int high=list.length-1;
while(high>=low)
{
int mid=(low+high)/2;
if(key<list[mid])
high=mid-1;
else if(key==list[mid])
return mid;
else
low=mid+1;
}
}
}
二分查找法
最新推荐文章于 2015-09-03 21:15:01 发布