摘要： '''python实现冒泡排序'''def maopao(list): n = len(list) for i in range(1, n): #第几趟 for j in range(0, n-i): if list[j] > list[j+1]: temp = list[j] list[j] = 阅读全文

摘要： '''二分查找：前提：数组是有序的时间复杂度：最优O(1) 最坏O(logN)'''def area(alist, targe): n = len(alist) left = 0 right = n - 1 while left <= right: mid = (left + right) // 2 阅读全文