标签：rem sim code 排序 turn 算法入门 style class move
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_sort(li):
for i in range(len(li) - 1):
min_loc = i
for j in range(i + 1, len(li)):
if li[j] < li[min_loc]:
min_loc = j
li[i], li[min_loc] = li[min_loc], li[i]
标签：rem sim code 排序 turn 算法入门 style class move
原文地址：https://www.cnblogs.com/argos/p/14290882.html
