EddyHawk's Info List
---
Sorting Algorithms:
---
-Bubble
 .Oldest sorting?
 .Average: Slowest?
 .Quadratic sort (2x data =  2x time to sort)
 .Best choice for very small (less than 100 items) or already sorted data

-Comb
 .Optimized Bubble
 .By Steven Lacey & Richard Box
 .Published in BYTE magazine April 1991
 .Comparable to Quick/Merge
 .n*log(n) sort
 .never slowing down
 .shrink factor = 1.3
 .if gap = 9 or 10 then gap = 11
 .speed up on partial/reverse sorted list

-Count
 .Comparable to Quick
 .prepare counter array of likely numbers & when encounter them simply 'inc' the counter :)

-Insertion
 .Worse than Selection?

-Selection
 .Worse than Shell

-Shell
 .fastest non-recursive sort?

-Merge
 .slightly better than Shell?
 .recursive sort
 .n*log(n) sort
 .most widely used sort?
 .simple?

-Quick
 .regarded as the fastest sort
 .recursive sort
 .needs large amount of memory

-Radix Exchange

-Faster Suffix Sort

Ideal sort:
-Skip already sorted data
-Fast on partial/reverse data
-n*log(n) sort