Selection Sort
Time Complexity: O(n^2)
Space Complexity: O(1)
Process
Run through the entire list and find the smallest element. Swap it with the first element. Repeat this process for the rest of the list.
Efficiency
Simple but inefficient for large lists. It has a time complexity of O(n^2) in the worst case. Generally performs worse than the closely related insertion sort.