def selection_sort(nums):
for i in range(len(nums)): # n
pos_min = i # idx
for j in range(i + 1, len(nums)): # n
if (nums[j] < nums[pos_min]):
pos_min = j
nums[i], nums[pos_min] = nums[pos_min], nums[i]
return nums
if __name__ == '__main__':
nums = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
print(selection_sort(nums))
运行结果
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]