/**
* 二分查找算法
* @author taller
*/
public class BinarySearch {
public static void main(String[] args) {
int[] arr = {1, 5, 7, 10, 22, 25, 33, 45, 50, 54, 55, 60, 70, 75, 88, 99, 100};
int temp = 25;
int index = getLength(arr,temp);
System.out.println("要查找的元素下标位置为:" + index);
}
private static int getLength(int[] arr, int temp) {
int start = 0;
int end=arr.length-1;
int index;
while (end >= start) {
index = start + ((end - start) >> 1);
if (arr[index] == temp) {
return index;
}
if (temp > arr[index]) {
start = index + 1;
}
if (temp < arr[index]) {
end = index - 1;
}
}
return -1;
}
}
二分查找算法
最新推荐文章于 2024-07-20 22:33:40 发布