python实现选择排序

list_1 = []       #先建一个空链表
print('输入排序个数：')
n = int(input())   #接收输入个数
for i in range(n):
    a = input()
    list_1.append(a) #将这n个数都存入链表
Lenth = len(list_1)
for i in range(Lenth - 1):
    Min = list_1[i]  #假设第一个数为最小值
    k = i
    for j in range(i+1, Lenth, 1): #内循环遍历，将最小的数排好，依次类推
        if Min > list_1[j]:
            Min = list_1[j]
            k = j
    list_1[i], list_1[k] = list_1[k], list_1[i]
print(list_1)

import random

def find_min(li):
    min_val = li[0]
    for i in range(1, len(li)):
        if li[i] < min_val:
            min_val = li[i]
    return min_val

def fin_min_pos(li):
    min_pos = 0
    for i in range(1, len(li)):
        if li[i] < li[min_pos]:
            min_pos = i
    return min_pos

def select_sort(li):
    for i in range(len(li)-1):
        # 无序区的范围 i, n-1
        min_pos = i
        for j in range(i+1, len(li)):
            if li[j] < li[min_pos]:
                min_pos = j
        li[i], li[min_pos] = li[min_pos], li[i]

li = list(range(10000))
#random.shuffle(li)
# print(li)
select_sort(li)