折半查找
public static void zb(){ int[] a = {1,3,5,8,10,13,15,17,23}; int find = 15; int high = a.length - 1; int low = 0; Integer index = null; while (low <= high){ int middle = (low + high)/2; if(a[middle] == find ){ System.out.println(middle); index = middle; } else if (a[middle] > find){ high = middle - 1; } else { low = middle + 1; } } if(index == null ){ System.out.println("未找到"); } }