public static int binarySearch(int[] list, int key) {

int low = 0;

int high = list.length - 1;

while (high >= low) {

int mid = (low + high) / 2;

if (key < list[mid])

high = mid - 1;

else if (key == list[mid])

return mid;

else

low = mid + 1;

}

return -1 - low;

}

Starting with this i need someone to help me single Dimensional Array Lecture:

Implement Binary Search for int numbers, and demonstrate it in the main method.

Note: if the key on multiple locations in the list of int number array, print all locations.

Java code