Selection Sort
code: python
# O(n^2), O(1)
def selection_sort(arr):
n = len(arr)
for i in range(n):
min_idx = i
for j in range(i+1, n):
if arrj < arrmin_idx:
min_idx = j
arri, arrmin_idx = arrmin_idx, arri
return arr
def test_selection_sort():
assert selection_sort(6, 1, 7, 8, 9, 3, 5, 4, 2) == 1, 2, 3, 4, 5, 6, 7, 8, 9