基础算法-二分查找

# coding=utf-8


def binary_search(array_s, num, left, right, middle):
	if right <= left:
		return False
	print array_s[middle],
	if array_s[middle] > num:
		right = middle
		middle = (left + right) / 2
		return binary_search(array_s, num, left, right, middle)
	if array_s[middle] < num:
		left = middle + 1
		middle = (left + right) / 2
		return binary_search(array_s, num, left, right, middle)
	else:
		return True


if __name__ == '__main__':
	s = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
	l = 0
	r = len(s) - 1
	m = (l + r) / 2
	res = binary_search(s, 2, l, r, m)
	print res