qq_37738024的博客

1，二分查找（非递归算法） def binary_search_3(alist,item): """ 二分法查找 :param alist: :param item: :return: """ start = 0 end = len(alist)-1 while start <= end: mid = (...

1.冒泡排序 def bubble_sort(alist): “”“冒泡排序”"" # 外层循环控制循环次数 for j in range(len(alist)-1): # j [0, 1,2,…n-2] #n-2-j count = 0 # 内层循环控制从头走到尾的遍历 for i in range(0,len(alist)-1-j): if alist[i]>alist[i+1]: al...