next up previous contents index Search
Next: Analysis Up: 0.3 Sorting Algorithms Previous: Source Code

0.3.7 Selection Sort


Logically, the Selection Sort is very easy to follow. It looks through the data set for the data item with the largest (or smallest) value and then, once found, puts this item at the end (or beginning) of the data set. The Selection Sort continues to look for maxima or minima on the remaining set of data until it has exhausted the data set.

Scott Gasch