二分查找法的运行时间为对数时间O(log₂n)
public class BinarySearchNoRecursion {
public static void main(String[] args) {
int[] arr = { 12, 15, 17, 42, 46, 100 };
int index = binarySearch(arr, 100);
System.out.println("index=" + index);
}
// 二分查找的非递归实现
public static int binarySearch(int[] arr, int target) {
int left = 0;
int right = arr.length - 1;
while (left <= right) {// 说明继续查找
int mid = (left + right) / 2;
if (arr[mid] == target) {
return mid;
} else if (arr[mid] > target) {
right = mid - 1;// 需要向左边查找
} else {
left = mid + 1;// 需要向右边查找
}
}
return -1;
}
}