我应该如何调整下面的选择排序代码，使其在看起来有点相同的情况下工作？python

Question

下面的代码没有遍历列表并对列表进行排序。我应该如何调整它，使其在看起来有点相同的情况下工作呢？我尝试了多种方法，但都没有成功。哦，还有，我知道选择排序快捷方式，sort（）函数，但我还想学习如何编写函数、程序和进程的代码。谢谢

def sortList(L,n):
    minValue = L[0]
    L2 = []
    idx = 0
    counter = 0
    
    while (counter < n):
        v = L[counter]
        if v < minValue:
            minValue = v
            idx = counter
            L2.append(minValue)
            del L[idx]
            n-=1

        counter += 1

    return L2

L = [34, -1, 0, 89, 21, -40, 7]
n = len(L)

print(sortList(L, n))

Answer 1

import sys
def selection_sort(unsorted_list):
    """Traverses the list to finds the min and inserts it in the beginning. 
    Then repeats traversing through the unsorted members, 
    each time popping and inserting the min after the previous mins."""

    my_list = list(unsorted_list)
    counter = 0
    j = 0
    while j < len(my_list):
        min = sys.maxsize
        min_index = -1
        for i in range(j, len(my_list)):
            counter += 1
            if my_list[i] < min:
                min = my_list[i]
                min_index = i
        
        a = my_list.pop(min_index)
        my_list.insert(j, a)
        j += 1
    return my_list

print(selection_sort([34, -1, 0, 89, 21, -40, 7]))
#output: [-40, -1, 0, 7, 21, 34, 89]