Binary Search

BinarySearch.java

static int binarySearchIterative(int[] a, int key) {
	int low = 0;
	int high = a.length - 1;
	
	while(low <= high) {
		int mid = (low + high) / 2;

		if(key == a[mid])
			return mid;
		else if (key < a[mid])
			high = mid -1;
		else if (key > a[mid])
			low = mid + 1;
	}

	return -1;
}

static int binarySearchRecursive(int[] a, int key, int low, int high) {
	if(low > high)
		return -1;

	int mid = (low + high) / 2;

	if(key == a[mid])
		return mid;
	else if (key < a[mid])
		return binarySearchRecursive(a, key, low, mid - 1);
	else 
		return binarySearchRecursive(a, key, mid + 1, high);
}