1.二分查找算法:
#coding=utf-8
def binary_search(num_list,x):
'''二分查找'''
num_list=sorted(num_list)
left,right = 0,len(num_list)
while left <right:
mid = int((left + right)/2) #获取中间的值得index
if num_list[mid] > x:
right = mid
elif num_list[mid] < x:
left = mid+1
else:
return '待查元素{0}在列表中下标位:{1}'.format(x,mid)
return '待查找元素%s不存在指定列表中'%x
if __name__ =='__main__':
num_list = [11,22,34,78,33,3,6,192,21,45,66]
print(binary_search(num_list,33))
mid 的值必须强制转化为int 型 不然会报错!!报错信息如下
TypeError: list indices must be integers or slices, not float
2.冒泡排序算法
def maopao_sort(arry):
n = len(arry)
for i in range(0,n-1):
for j in range(0,n-1-i):
if arry[j] >arry[j+1]:
arry[j],arry[j+1] = arry[j+1],arry[j]
return arry