Python 算法

冒泡排序 :
def func(alist):
for x in range(1,len(alist)):
for i in range(0,len(alist)-x):
if alist[i] > alist[i+1]:
alist[i], alist[i+1] = alist[i+1], alist[i]
return alist
print(func([1,4,2,3,6,7,8,9,0,5]))

选择排序 :
def func(alist):
for x in range(0,len(alist)):
min_num = alist[x]
for i in range(x+1,len(alist)):
if alist[i] < min_num:
alist[i], min_num = min_num, alist[i]
alist[x] = min_num
return alist
print(func([1,4,2,3,6,7,8,9,0,5]))

斐波那契
def func(n):
a = 0
b = 1
alist = []
if n <= 2:
alist.append(a)
alist.append(b)
return alist
else:
for i in range(n):
alist.append(a)
a, b = b, a + b
return alist

print(func(9))

二分法
def func(alist, item):
low = 0
high = len(alist)-1
n = 0
whil