可以使用java.util.Arrays.binarySearch()方法在数组上执行二进制搜索。如果所需元素的索引在数组中可用,则此方法返回它的索引,否则返回(-(插入点)-1),其中插入点是元素将在数组中插入的位置。
演示此的程序如下所示-
示例import java.util.Arrays;
public class Demo {
public static void main(String[] args) {
int arr[] = { 3, 9, 1, 6, 4};
Arrays.sort(arr);
System.out.print("The sorted array is: ");
for (int i : arr) {
System.out.print(i + " ");
}
System.out.println();
int index1 = Arrays.binarySearch(arr, 6);
System.out.println("The integer 6 is at index " + index1);
int index2 = Arrays.binarySearch(arr, 7);
System.out.println("The integer 7 is at index " + index2);
}
}
输出结果The sorted array is: 1 3 4 6 9
The integer 6 is at index 3
The integer 7 is at index -5
现在让我