Recursive Binary Search | Python

Technical 1 Minute

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

I am Vivek Joshi, I am currently working as Product Lead for Verificient Technologies. * I have 8+ years of experience in the Field of Web Development. * Expertise in Python, Django, Linux, GIT, SQL/NOSQL , Javascript, Jquery, AngularJS. * Skillful in Taking the Product From Scratch to Deployment. * Good with Product Planning, Product Module Management, and Meeting Tough Deadlines. * Proficient in Managing unlike teams. ** I am trying to use this blog as a medium to share and save some of my knowledge in the field of Web development.

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