def selection_sort(numbers):
n = len(numbers)
for i in range(n - 1):
min_index = i
for j in range(i + 1, n):
if numbers[j] < numbers[min_index]:
min_index = j
numbers[i], numbers[min_index] = numbers[min_index], numbers[i]
return numbers
print(selection_sort([5, 2, 4, 1, 3])) # [1, 2, 3, 4, 5]