Divide the array into sorted and unsorted portions. Repeatedly find the minimum element in the unsorted portion and move it to the end of the sorted portion.
time:O(n²)
space:O(1)
⚡ +100_XP
step[1/32]
> Start
64
25
12
22
11
90
▸Selection Sort: find the minimum element in the unsorted portion and swap it to the front.
// tap NEXT STEP to walk through one step at a time