| 1. | Indeed, selection sort does one pass through the remaining items for each item moved.
|
| 2. | If the input array is reverse-sorted, insertion sort performs as many comparisons as selection sort.
|
| 3. | Selection sort can be implemented as a stable sort.
|
| 4. | So for unsorted input, insertion sort will usually perform about half as many comparisons as selection sort.
|
| 5. | Here is partial selection sort-based algorithm:
|
| 6. | Selection sort is noted for its simplicity, and also has performance advantages over more complicated algorithms in certain situations.
|
| 7. | Selection sort can also be used on list structures that make add and remove efficient, such as a linked list.
|
| 8. | More generally, a partial selection sort yields a simple selection algorithm which takes O ( " kn " ) time.
|
| 9. | Among simple average-case ? ( " n " 2 ) algorithms, selection sort almost always outperforms bubble sort and gnome sort.
|
| 10. | When sorting a hand of cards for bridge or similar games, many people use an insertion sort; I prefer a selection sort.
|
