选择排序
每次从列表中选择一个最小的元素放到无序区的最前面
时间复杂度:O(n^2)
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]
print(li)
li = [3,4,2,1,5,6,8,7,9]
print(li)
print('='*30)
select_sort(li)