[英]Java binary search count number of comparisons
我在java中为二进制搜索编写了以下代码:
import java.util.Arrays;
class BinarySearch {
public static int binarySearch(double[] arr, double x, int high, int low) {
int mid=(high+low)/2;
if(high==low || low==mid || high==mid) {
return -1;
}
if(arr[mid]<x) {
return binarySearch(arr, x, high, mid);
}
else if(arr[mid]>x) {
return binarySearch(arr, x, mid, low);
}
else if(arr[mid]==x) {
return mid;
}
return -1;
}
public static void main(String args[]) {
int n=1000;
double array[] = new double[n];
for (int i=0; i<100; i++) {
for (int k = 0; k < n; k++) {
double r = Math.random();
r = r * 100;
r = Math.round(r);
r = r / 100;
array[k] = r;
}
Arrays.sort(array);
double search = Math.random();
search = search * 100;
search = Math.round(search);
search = search / 100;
int result=binarySearch(array, search, n, 0);
if (result == -1)
System.out.println(search +" befindet sich nicht im Array.");
else
System.out.println(search+" befindet sich im Array an der Stelle "+(result)+".");
}
}
}
我想看看二进制搜索需要做的比较次数才能找到数字,但我不知道如何实现它。 我已经做了一个循环,所以我可以看到比较的平均值,但我不知道如何获得比较的数量。
你可以这样做,以保持简单。
private static int comparisions = 0;
public static int binarySearch(double[] arr, double x, int high, int low) {
int mid = (high + low) / 2;
if (high == low || low == mid || high == mid) {
comparisions++;
return -1;
}
if (arr[mid] < x) {
comparisions++;
return binarySearch(arr, x, high, mid);
} else if (arr[mid] > x) {
comparisions++;
return binarySearch(arr, x, mid, low);
} else if (arr[mid] == x) {
comparisions++;
return mid;
}
return -1;
}
public static void main(String args[]) {
int n = 1000;
double array[] = new double[n];
for (int i = 0; i < 100; i++) {
for (int k = 0; k < n; k++) {
double r = Math.random();
r = r * 100;
r = Math.round(r);
r = r / 100;
array[k] = r;
}
Arrays.sort(array);
double search = Math.random();
search = search * 100;
search = Math.round(search);
search = search / 100;
int result = binarySearch(array, search, n, 0);
System.out.println("Number of comparisions " + comparisions);
if (result == -1)
System.out.println(search + " befindet sich nicht im Array.");
else
System.out.println(search + " befindet sich im Array an der Stelle " + (result) + ".");
}
}
在代码的顶部声明一个int
,并在每个return语句之前递增它(因为这是比较的最后一步)。
int compares = 0;
//other code
compares++;
return blahblah;
您可以在递归方法的调用链中传递比较次数,如下所示:
public static int binarySearch(double[] arr, double x, int high, int low, int cmp) {
...
if(arr[mid]<x) {
// We made one additional comparison
return binarySearch(arr, x, high, mid, cmp+1);
} else if(arr[mid]>x) {
// We made two additional comparisons
return binarySearch(arr, x, mid, low, cmp+2);
} else {
// We made two additional comparisons.
// We are about to return the result, so print the final number of comparisons:
System.out.println("Performed "+(cmp+2)+" comparisons.");
return mid;
}
}
在main
的调用中为cmp
参数传递零。
在binarysearch()
之外声明一个变量
import java.util.Arrays;
class BinarySearch {
int num_of_calls = 0;
public static int binarySearch(double[] arr, double x, int high, int low) {
num_of_calls++;
...
}
num_of_calls
将包含调用递归函数的次数。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.