The Selectionsort Algorithm
p
Start by
finding the
smallest
entry.
[0]
[1]
[2]
[3]
[4]
[5]
The first sorting algorithm that we'll examine is called Selectionsort. It begins by going through the entire array and finding the smallest element. In this example, the smallest element is the number 8 at location [4] of the array.
