Binary Search

binary_search.java

    private static int binarySearch( int[ ] a, int toFind, int low, int high )
	{
		if( low > high )
			return -1;
		
		int mid = ( low + high ) / 2;
		
		if( a[ mid ] > toFind  )
			return binarySearch( a, toFind, mid + 1, high );
		else if( a[ mid ] <  toFind )
			return binarySearch( a, toFind, low, mid - 1 );
		else
			return mid+1;
	}