public static void main(String[] args) {
int[] arr = {1, 2, 3, 4, 5, 6};
int i = binarySearch(arr, 6);
System.out.println(i);
}
private static int binarySearch(int[] arr, int num) {
int min = 0;
int max = arr.length - 1;
while (true) {
if (min > max) {
return -1;
}
int mid = (min + max) / 2;
if (arr[mid] < num) {
min = mid + 1;
} else if (arr[mid] == num) {
return mid;
} else if (arr[mid] > min) {
mid = mid - 1;
}
}
}