摘要: #选择排序 def insert_sort(li): for i in range (1,len(li)): # i表示摸到牌的下标 tem = li[i] j = i - 1 # j 是初始手中的牌 while j >= 0 and li[j] > tem :#找到比它小的牌 li[j+1] = 阅读全文
posted @ 2020-05-06 10:28 橙子Cjw 阅读(153) 评论(0) 推荐(0) 编辑