A simple binary search algorithm written in python for searching through arrays in O(log_2(n)) time.

binary_search.py

def binarySearch(array,target):
	min = 0
	max = len(array)-1
    guess = 0
    while max>=min:
        guess = floor((min+max)/2)
        if array[guess] == target: return guess
        else if array[guess] < target: min = guess+1
        else: max = guess-1