The Selectionsort Algorithm
p
Find the
smallest
element in
the unsorted
side.
Sorted side
Unsorted side
[0]
[1]
[2]
[3]
[4]
[5]
Each step of the Selectionsort works by finding the smallest element in the unsorted side. At this point, we would find the number 15 at location [5] in the unsorted side.
