Java 二分查找算法实现：查找有序数组中的值

public class ArrayTest3 { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); // 二分查找 // 使用二分法查找前提是必须有序 int[] arr2 = {-1, 2, 4, 5, 6, 7, 8, 9, 11, 12}; System.out.println('请出入你要找的值：'); int index = scanner.nextInt(); int head = 0; int end = arr2.length - 1; boolean isFlag1 = true; while (head <= end) { int mid = (head + end) / 2; if (index == arr2[mid]) { System.out.println('恭喜找到了，位置为：' + mid); isFlag1 = false; break; } else if (arr2[mid] > index) { end = mid - 1; } else { head = mid + 1; } } if (isFlag1) { System.out.println('对不起，没有找到'); } }