7-3 二分查找法
用二分法在一个有序数列{1,2,3,4,5,6,7,8,9,10}中查找key值,若找到key则输出其在数组中对应的下标,否则输出not found。
输入格式:
直接输入一个要查找的正整数key。没有其它任何附加字符。
输出格式:
找到则在一行中按照“weizhi:下标”的格式输出其在数组中对应的下标,否则输出not found。
输入样例:
4
输出样例:
weizhi:3
输入样例:
15
输出样例:
not found
import java.util.Scanner;
public class BinarySearch {
public static int find(int[] arr, int k) {
int left = 0;
int right = arr.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (arr[mid] < k)
left = mid + 1;
else if (arr[mid] > k)
right = mid - 1;
else // arr[mid] == k
return mid;
}
return -1; // Not found
}
public static void main(String[] args) {
int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the element to search: ");
int k = scanner.nextInt();
int ret = find(arr, k);
if (ret == -1)
System.out.println("Element not found");
else
System.out.println("Index: " + ret);
scanner.close();
}
}