Binary Search Python

”’
Created on Jul 2, 2017

@author: asharda
”’

arr=[1,2,4,8,12]

def bSearch(arr,target):
low=0
high=len(arr)-1
while(low<=high):
mid=low+high/2
if(target==arr[mid]):
return True
elif(target>arr[mid]):
low=low+1
elif(target<arr[mid]):
high=high-1
return False

b=bSearch(arr, 3)
if(b==True):
print(“Number Found”)
else:
print(“Number not Found”)

Advertisements

About qainterviews

Software Geek,QA Expert,Blogger
This entry was posted in Python, Uncategorized. Bookmark the permalink.

Leave a Reply

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

WordPress.com Logo

You are commenting using your WordPress.com 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 )

Google+ photo

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

Connecting to %s