Java Program to Perform Binary Search
Searches a sorted array using binary search.
import java.util.*;
public class Main {
static int binarySearch(int[] a, int x) {
int l = 0, r = a.length - 1;
while (l <= r) {
int m = (l + r) >>> 1;
if (a[m] == x) return m;
if (a[m] < x) l = m + 1; else r = m - 1;
}
return -1;
}
public static void main(String[] args) {
int[] arr = {1, 3, 5, 7, 9};
System.out.println(binarySearch(arr, 7));
}
}3