二分查找-python

二分查找-python

import math
def binary_search(list, target)
	low = 0
	high = len(list) - 1
	while low <= high:
		mid = math.floor((low+high)/2)
		guss = list[mid]
		if guss == target:
			return mid
		if (guss > target):
			high = mid - 1
		else:
			low = mid + 1
	return None

if __name__ == "__main_":
	m_list = [1, 3, 5, 7]
	target_index = binary_search(m_list,3) # return 1