import random
def section_sort1(alist):
    n = len(alist)
    # 定義外圍循環(huán)次數(shù)
    for j in range(n - 1):
        # 定義min_index最小值的索引為j,目的找出最小值
        min_index = j
        # cur下標(biāo)移動(dòng)的范圍，比較次數(shù)的范圍限定
        for i in range(j + 1, n):
            # 元素比較，找出最小的值對(duì)應(yīng)的索引
            if alist[i] < alist[min_index]:
                # 移動(dòng)到最小元素的位置
                min_index = i
 
        # 保證最新的min_index不在無(wú)序隊(duì)列的首位,那么就將它和無(wú)序隊(duì)列的首位替換
        if min_index != j:
            alist[j], alist[min_index] = alist[min_index], alist[j]
 
def section_sort2(alist):
    n = len(alist)
    # 定義外圍循環(huán)次數(shù)
    for j in range(n - 1):
        # 定義min_index最小值的索引為j,目的找出最小值
        min_index = j
        # cur下標(biāo)移動(dòng)的范圍，比較次數(shù)的范圍限定
        for i in range(j + 1, n):
            # 元素比較，找出最小的值對(duì)應(yīng)的索引
            if alist[i] > alist[min_index]:
                # 移動(dòng)到最小元素的位置
                min_index = i
 
        # 保證最新的min_index不在無(wú)序隊(duì)列的首位,那么就將它和無(wú)序隊(duì)列的首位替換
        if min_index != j:
            alist[j], alist[min_index] = alist[min_index], alist[j] 
 
n=int(input())
alist=[random.randint(0,100)for i in range(n)]
print(alist)
section_sort1(alist)
print("排序后1:",alist)
section_sort2(alist)
print("排序后2:",alist)

>>> L = [2,3,5,4,9,6,8,7,1]
>>> T = []
>>> while len(L) > 0:
...     m = min(L)
...     L.remove(m)
...     T.append(m)
>>> T
[1, 2, 3, 4, 5, 6, 7, 8, 9]