import numpy as np
def binarySearch(arr, r, h, item): 
	while r <= h: 
		mid = int((r + h) /2) 
		# Check if x is present at mid 
		if arr[mid] == item: 
			return mid 
		# If x is greater, ignore left half 
		elif arr[mid] < item: 
			r = mid + 1
		# If x is smaller, ignore right half 
		else: 
			h = mid - 1
	# If we reach here, then the element 
	# was not present 
	return -1
