package lecture01;


UNFINISHED!!!

public class BinarySearch {

	/* Returns the first location of x in list
	 * list must be sorted in increasing order!!!
	 * -1 if x is not in the list
	 */
	static int index(int [] list, int x) {
		int begin = 0;
		int end = list.length - 1;

		while (begin<=end) {
			int mid = (begin+end)/2;
			if (list[mid]==x) {
				return mid;
			}
			else if(list[mid]<x) {
				begin = mid+1;
			}
			else {
				end = mid -1;
			}
		}
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

}