Selection sort

Selection sort is a family of sort algorithms that works as follows:

• remove the lowest datum one at a time until the set of data is empty

The naive algorithm, iterating through the list of unsorted data, has O(N²) performance. Heapsort optimizes the algorithm by using a heap data structure to speed finding and removing the lowest datum.