摘要:
def partition(li, left, right): """ 取出列表最左边的点作为基点, 从列表右边开始遍历列表,如果li[right]>= tmp不成立, 此时li[right] < tmp,将li[right] 赋值给li[left] ,依次循环 """ tmp = li[left] 阅读全文
摘要:
def insert_sort(li): for i in range(1, len(li)): # 表示摸到的牌的下标 tmp = li[i] j = i - 1 # 指的是手里的牌的下标 while j >= 0 and li[j] > tmp: li[j+1] = li[j] j -= 1 l 阅读全文
摘要:
def select_sort_simple(li): li_new = [] for i in range(len(li)): min_val = min(li) li_new.append(min_val) li.remove(min_val) return li_new def select_ 阅读全文