|
PureBytes Links
Trading Reference Links
|
> The bubble, insertion, and exchange sort are all O(N^2) sorts, and should
> be at the top of that list. Shell's algorithm is in the middle, as well
> as the combsort (not mentioned), these being O(N^1.2). Quicksort and
> heapsort, both O(N log N) should be similar in performance for large
> randomly-ordered arrays, although quicksort reverts to a "slowsort" if the
> input array is reverse-ordered.
>
> The O(N log N) sorts CAN be written inefficiently, however. An
> implementation of quicksort, for example, that makes use of OS-dependent
There is apparently a O(N) sort called ABCSort.
A description and a C implementation of the sort
algorithm can be found at
http://www.beechick-sort.bizhosting.com/abcsort.html
The algorithm is however patented so there
are licensing issues.
Cheers,
Allister
|