JAVA编程分别实现顺序查找和二分查找算法﹐输出在序列(5,11,23,35,51,64,72,85,88,90,98）中，使用二分查找查询30和72的比较次数和查找结果，并输出-CSDN博客

本文链接：https://blog.csdn.net/weixin_35755188/article/details/128872670

文章展示了如何使用Java实现顺序查找和二分查找算法，分别在给定数组中查找两个目标值（30和72），并计算了比较次数。顺序查找在找到目标值后立即终止，而二分查找利用了排序数组的特性，将搜索范围逐步缩小，通常效率更高。

摘要由CSDN通过智能技术生成

顺序查找:

int[] arr = {5,11,23,35,51,64,72,85,88,90,98};
int target1 = 30;
int target2 = 72;
int count1 = 0;
int count2 = 0;

for (int i = 0; i < arr.length; i++) {
    if (arr[i] == target1) {
        System.out.println("找到了，在第" + (i + 1) + "个位置");
        break;
    }
    count1++;
}
System.out.println("比较次数: " + count1);

for (int i = 0; i < arr.length; i++) {
    if (arr[i] == target2) {
        System.out.println("找到了，在第" + (i + 1) + "个位置");
        break;
    }
    count2++;
}
System.out.println("比较次数: " + count2);

二分查找:

int[] arr = {5,11,23,35,51,64,72,85,88,90,98};
int target1 = 30;
int target2 = 72;
int count1 = 0;
int count2 = 0;

int left = 0;
int right = arr.length - 1;
int mid;

while (left <= right) {
    mid = (left + right) / 2;
    if (arr[mid] == target1) {
        System.out.println("找到了，在第" + (mid + 1) + "个位置");
        break;
    } else if (arr[mid] < target1) {
        left = mid + 1;
    } else {
        right = mid - 1;
    }
    count1++;
}
System.out.println("比较次数: " + count1);

left = 0;
right = arr.length - 1;
while (left <= right) {
    mid = (left + right) / 2;
    if (arr[mid] == target2) {
        System.out.println("找到了，在第" + (mid + 1) + "个位置");
        break;
    } else if (arr[mid] < target2) {
        left = mid + 1;
    } else {
        right = mid - 1;
    }
    count2++;
}
System.out.println("比较次数: " + count2);