这是二分搜索算法的正确实现吗?它有效,但它是我想出的实现,与我的导师不同。谁能帮我在上面打个洞吗?
package algorithm.linearsearch;
公共(public)类 BinarySearch {
public static void main(String[] args) {
System.out.println(binarySearch(
new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 26, 109, 1001, 1100 },
26));
}
private static int binarySearch(int[] array, int target) {
int p = 0;
int r = array.length - 1;
int q;
while (p <= r) {
q = (p + r) / 2;
if (array[q] == target) {
System.out.println("value: " + array[q]);
return q;
}
if (array[q] > target) {
r = q + 1;
} else {
p = q - 1;
}
}
return -1;
}
}
最佳答案
就这个
if (array[q] > target) {
r = q + 1;
} else {
p = q - 1;
}
应该是
if (array[q] > target) {
r = q - 1; // index lower to current pivot
} else {
p = q + 1; // index upper to current pivot
}
关于Java:二分查找,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/45901216/