- [0]
- [1]
- [2]
- [3]
- [4]
Selection sort searches the entire array for the smallest number. When it finds the smallest number it will move it to [0] and [0] will be considered fully sorted.
Selection sort is a sorting algorithm that will sort an array of numbers.
Selection sort searches the entire array for the smallest number. When it finds the smallest number it will move it to [0] and [0] will be considered fully sorted.