class F
{
public static void main(String[] args)
{
//二分查找
int[] T = {1,2,3,4,5,6,7,8,9};
int k = 9;
if (search(T,k) == -1)
System.out.println("没找到?");
else
System.out.println("下标为 :" + search(T,k));
}
public static int search (int[] T,int key)
{
int low = 0;
int high = T.length - 1;
int i = 0;
while(high>=low)
{
int mid = (high + low) / 2;
if (key < T[mid])
high = mid - 1;
else if (key == T[mid])
return mid;
else
low = mid + 1;
}
return -1;
}
}
二分法匹配数组找下标值
最新推荐文章于 2022-07-05 13:55:34 发布