排序算法-二分查找

二分查找

 

public static int binarySearch(int[] srcArray, int des) { int low = 0; int high = srcArray.length - 1; while (low <= high) { int middle = (low + high) / 2; if (des == srcArray[middle]) { return middle; } else if (des < srcArray[middle]) { high = middle - 1; } else { low = middle + 1; } } return -1; } public static void main(String[] args) { int[] src = new int[] { 1, 3, 5, 7, 8, 9 }; System.out.println(binarySearch(src, 3)); }