概念
选择算法也是一种比较简单,他是每次找到一个无序序列的最小值,放在最左侧,然后再从剩余的数中再找出最小的,放在当前的的最左侧,直到排序结束。
Code
def select_sort(l):
for i in range(0, len(l) - 1):
min = l[i]
min_idx = i
for j in range(i + 1, len(l)):
if l[j] < min:
min_idx = j
min = l[j]
tmp = l[i]
l[i] = l[min_idx]
l[min_idx] = tmp
Test
def test():
l = [9911199, 7, 4, 5, 3, 6, 9, 7, 8, 0]
print l
select_sort(l)
print l