摘要： def bubble_sort(data): for i in range(len(data)-1): print(f'这是第{i+1}趟') for j in range(len(data) - 1 - i): if data[j] > data[j + 1]: data[j], data[j + 阅读全文

摘要： def binary_find(list, target): left, right = 0, len(list) while left <= right: mid = (left + right) // 2 print(list[mid]) list_left = list[left:mid] p 阅读全文