Binary search implementation

bs.py

def binarySearch (array, element):
	a = 1
	b = len(array)
	while array[int((a+b)/2)] != element:
		m = int((a+b)/2)
		if (array[m]) > element:
			b = m - 1
		else:
			a = m + 1
		if a > b:
			return False
	return True