选择排序

就是,有一个,

a = [2,3,1,5,0]

把最小的找出来和第一个交换位置

a = [0,3,1,5,2]

然后,除开第一个数,在剩余的里面再找最小的

0
[ 3,1,5,2 ] > [ 1,3,5,2 ]
[0,1,3,5,2]

然后,重复

def func(a):
    for n in range(len(a)-1):
        minl = a[n:].index(min(a[n:]))+n
        a[n],a[minl] = a[minl],a[n]
        
    return a

结果呢…

from random import randint
a =  [ randint(-40,60) for n in range(15) ]
print(a)
print(func(a))

[-20, 11, 21, 2, -35, -32, -11, 14, 13, 58, -16, -20, 3, -16, -1]
[-35, -32, -20, -20, -16, -16, -11, -1, 2, 3, 11, 13, 14, 21, 58]