(Generic binary search) Implement the following method using binary search. public static <E extends Comparable<E>> int binarySearch(E[] list, E key)

/*********************************************************************************
* (Generic binary search) Implement the following method using binary search.    *
*                                                                                *
* public static <E extends Comparable<E>>                                        *
*	int binarySearch(E[] list, E key)                                             *
*********************************************************************************/
public class Exercise_19_07 {

	/** Method performs a binary search 
	  * to find the key in a list */ 
	public static <E extends Comparable<E>>
			int binarySearch(E[] list, E key) {
		int low = 0;
		int high = list.length - 1;

		while (high >= low) {
			int mid = (low + high / 2);
			if (key.compareTo(list[mid]) < 0)
				high = mid - 1;
			else if (key.compareTo(list[mid]) == 0)
				return mid;
			else
				low = mid + 1;
		}

		return -low - 1;
	}
}