def binary_search(arr,ele):
"""
binary_search works only on sorted array, also it follows divide and conquer fundamentals
"""
first = 0
last = len(arr) - 1 # as indexing starts at 0
found = False
while first <= last and not found:
mid = (first+last)/2 # to get mid point of array
if arr[mid] == ele:
found = True
else:
if ele < arr[mid]:
last = mid - 1
else:
first = mid + 1
return found
b = binary_search([1,2,3,4,5],2)
print b
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.
View all posts by Vivek
