选择排序

def SelectionSort(nums):
    n = len(nums)
    end = n - 1
    for j in range(n):
        max_ = nums[-1 - j]
        max_idx = -1 - j
        for i in range(end):
            if nums[i] > max_:
                max_ = nums[i]
                max_idx = i
            else:
                continue
        nums[-1 - j], nums[max_idx] = nums[max_idx], nums[-1 - j]
        end = end - 1
    return nums