Selection Sort
1/0
1.0x
Selection Sort
O(n²)
Space: O(1)
Pseudocode
1
procedure selectionSort(A: list)
2
n ← length(A)
3
for i ← 0 to n - 2 do
4
minIdx ← i
5
for j ← i + 1 to n - 1 do
6
if A[j] < A[minIdx] then
7
minIdx ← j
8
swap(A[i], A[minIdx])
9
return A
Random Input