- 时间复杂度O(n2)
- 不稳定排序
def select_sort(arr):
for i in range(len(arr)):
min_index = i
for j in range(j+1, len(arr)):
if arr[i] < arr[j]:
min_index = j
if min_index != i:
arr[i], arr[min_index] = arr[min_index], arr[i]