public static int binarySerch(int [] arr,int k) { int low = 0; int high = arr.length - 1; while (low < high) { int temp = (low + high) >>> 1; if (k == arr[temp]) { return temp; } if (k > arr[temp]) { low = temp + 1; } if (k < arr[temp]) { high = temp - 1; } } return -1; }
二分法
最新推荐文章于 2024-11-08 19:18:52 发布