Teacher Instructions:

Create the binarySearch() method for String arrays from the downloaded version for ints so the program can find String. Wrap a main around it, of course, so that we can see how it works.

Provided Code:

// Returns the index of an occurrence of target in a,

// or a negative number if the target is not found.

// Precondition: elements of a are in sorted order

public static int binarySearch(int[] a, int target) {

int min = 0;

int max = a.length - 1;

while (min <= max) {

int mid = (min + max) / 2;

if (a[mid] < target) {

min = mid + 1;

} else if (a[mid] > target) {

max = mid - 1;

} else {

return mid; // target found

}

}

return -(min + 1); // target not found