每天一道算法题之选择排序

'''这是一个选择排序算法的实现'''

import  random

ls = [random.randrange(0,1000) for i in range(10)]

print(ls)

# [38, 92, 283, 272, 165, 87, 520, 242, 549, 844]
# [38, 87, 283, 272, 165, 92, 520, 242, 549, 844]
# [38, 87, 92, 272, 165, 283, 520, 242, 549, 844]
# [38, 87, 92, 165, 272, 283, 520, 242, 549, 844]
# [38, 87, 92, 165, 272, 283, 520, 242, 549, 844]
# [38, 87, 92, 165, 272, 242, 520, 283, 549, 844]
# [38, 87, 92, 165, 272, 242, 283, 520, 549, 844]
# [38, 87, 92, 165, 272, 242, 283, 520, 549, 844]
# [38, 87, 92, 165, 272, 242, 283, 520, 549, 844]






ls1 = [165, 92, 283, 272, 38, 87, 520, 242, 549, 844]

def select_sort(alist):

    ls_Len = len(ls1)

    for i in range(ls_Len-1):   #最后的那次不需要循环


        min_index = i  # 首先假设第一个位置上的是最小值

        for j in range(i+1, ls_Len):
            if alist[min_index] > alist[j]:
                min_index = j  # 查找剩余列表中最小值的索引

        alist[i], alist[min_index] = alist[min_index], alist[i] # 将查找的最小值复制到最初的位置上

    print(alist)


select_sort(ls1)