| 1 | 5 | ||||||||||||||||||||||||
| 2 | |||||||||||||||||||||||||
| 3 | |||||||||||||||||||||||||
| 4 | |||||||||||||||||||||||||
1. A type of sorting algorithm that requires a minimal amount of additional memory space to sort the data.
2. The portion of the list that has not yet been sorted, from which elements are selected to be moved to the sorted region.
3. A computational complexity that describes the amount of time it takes to run an algorithm as a function of the length of the input.
4. A comparison-based sorting algorithm that repeatedly selects the smallest or largest element from an unsorted region and moves it to the end of the sorted region.
5. A simple sorting algorithm that divides the input list into a sorted and an unsorted region, repeatedly selecting the smallest element from the unsorted region and moving it to the sorted region.