1.二分查找:

Note:二分查找列表必須是有序的

def binary_search(find, _list): # 二分查找
sindex = 0
eindex = len(_list)
while sindex < eindex:
mid = (sindex + eindex)/2
if _list[mid] == find:
return mid
elif _list[mid] > find:
eindex = mid - 1
else:
sindex = mid + 1

return -1

2.斐波數列：

def fib(number):
_list = [0,1]
for i in range(number-1):
_list.append(_list[-2]+_list[-1])

return _list[1:]

Python實現經典查找算法