选择排序——直接选择排序

本文借鉴于lsgo实验室创始人马老师
算法：

程序

def StraightSelectSort(nums):
    for i in range(len(nums)-1):
        k =i # 记录最小的数
        temp = nums[i]
        for j in range(i+1,len(nums)):
            # 选出最小的数
            if temp > nums[j]:
                k =j
                temp = nums[j]
        if k != i:
            nums[k] = nums[i]
            nums[i] = temp
    return nums


a = [49, 38, 65, 97, 60, 76, 13, 27, 5, 1,1]
result = StraightSelectSort(a)
print(result)