【发布时间】:2016-04-18 04:10:24
【问题描述】:
我正在努力解决这个教科书问题。我必须对 BinarySearch 函数进行哪些修改,以便它打印出与目标进行比较的数组元素序列?
public class BinarySearch {
public static int binarySearch(int[] A, int p, int r, int target) {
int q;
if(p > r) {
return -1;
}else {
q = (p + r)/2;
if(target == A[q]) {
return q;
} else if (target < A[q]) {
return binarySearch(A, p, q-1, target);
} else {
return binarySearch(A, q+1, r, target);
}
}
}
public static void main(String[] args) {
int[] B = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
System.out.println(binarySearch(B, 0, B.length-1, 7));
System.out.println(binartSearch(B, 0, B.length-1, 2));
System.out.println(binarySearch(B, 0, B.length-1, 11));
}
}
【问题讨论】:
-
你在打印时拼错了
binarySearchSystem.out.println(binartSearch(B, 0, B.length-1, 2));。其余代码看起来没问题
标签: java recursion binary-search