Computer Science - Algorithms - Binary search - Binary Search Algorithm

5 steps. Step 1 'Prerequisites': Array MUST be sorted! If not sorted, sort first or use linear search. Step 2 'The Algorithm': def binary_search(arr, target): low, high = 0, len(arr)-1; while low <= high: mid = (low+high)//2; if arr[mid] == target: return mid; elif arr[mid] < target: low = mid+1; el