Recursive Binary Search | Python

Technical 0 Minutes

Implement recursive binary search in Python

def recursive_binary_search(arr,ele):

	if len(arr) == 0:
		return False

	else:
		mid = len(arr)/2

		if arr[mid] == ele:
			return True
		else:
			if ele < arr[mid]:
				return recursive_binary_search(arr[:mid], ele)
			else:
				return recursive_binary_search(arr[mid+1:], ele)

d = recursive_binary_search([1,2,3,4,5],22)
print d

Published by Vivek

Myself Vivek Joshi, I am a Python Django developer currently living in Pune, India. By now, I have been professionally using Django for than 6 years. I started this blog to share and store some of my learning while working on some amazing projects. To be fair, I am no biggie/expert when it comes to Python and Django but i think it's good to share something with others than nothing. I am open for collaborations, so if you feel i can be of any help to you than shout me email at joshi.vj22@gmail.com and i will be happy to be of any assistance.

Published

Leave a Reply

Fill in your details below or click an icon to log in:

Gravatar
WordPress.com Logo

You are commenting using your WordPress.com account. ( Log Out /  Change )

Google photo

You are commenting using your Google account. ( Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. ( Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. ( Log Out /  Change )

Cancel

Connecting to %s