第十三讲：二分查找

# -*- coding:utf-8 -*-
# 二分查找
def binarySearch(searchList, target):
left = 0
right = len(searchList) - 1
while left <= right:
mid = (left + right) / 2
if searchList[mid] < target:
left = mid + 1
continue
if searchList[mid] == target:
return mid
if searchList[mid] > target:
right = mid - 1
continue
return None
searchList = [1, 3, 4, 6, 8, 9]
# print binarySearch(searchList, 5)
# print binarySearch(searchList, 1)
# print binarySearch(searchList, 3)
# print binarySearch(searchList, 4)
# print binarySearch(searchList, 6)
# print binarySearch(searchList, 8)
# print binarySearch(searchList, 9)