Binary Search in Python
By Gaurav Jain on January 13, 2018
Return the index of a number in the given list/array
def binary_search(alist, num): l, r = 0, len(alist) - 1 while l <= r: mid = (l + r) // 2 if alist[mid] < num: l = mid + 1 elif alist[mid] > num: r = mid - 1 else: return mid return None # If number doesn't exist in the list
>>> mylist = [1, 2, 3, 4, 5, 6, 7] >>> num = 3 # number to be searched >>> binary_search(mylist, num) 2 >>>
This code can be found on Github [Python-DSA].
If you find anything wrong or has a better solution, please feel free to create issues on this repo.