Search Algorithms

binarySearch.py

def binarySearch(data,search):
	while len(data) > 1:
		mid=len(data)//2
		if data[mid] is search:
			return True
		elif data[mid] > search:
			return binarySearch(data[:mid],search)
		else:
			return binarySearch(data[mid:],search)
	if len(data) is 1:
		if data[0] is search:
			return True

#data contains the sorted list of elements in ascending order
#serach is the element to be searched in data.
data=[1,2,4,5,7,21,31]
search=21

status=binarySearch(data,search)
if status is True:
	print("Search element {} is Found".format(search))
else:
	print("Search element {} is not Found".format(search))