|
The sort in GNU/free Linux uses merge sorting which is explained in the Sorting algorithm wiki page.
=== newHeadsort development, opposite of Sortmergesort ===
* [http://sourceforge.net/p/headsort/ headsort] Begins streaming most rapidly yet can be many times faster than mergesort on tail in best cases. "headsort -k5 -k1 -k3 ..." | head | ..." (it's best worst case are about opposite merge's). it doesn't need to wait on all bins to finish before streaming, but merge does. very compatible with but not a drop in for gnu-sort(1).
Sort uses merge sorting and is speedy to complete 1 column sorting (in a table of rows and colums of words to be selected and sorted).
also has: bubble, selection, insertion, shell,
There is a new sort(1), headsort(1), using an algorthim with opposite speed properties of merge sort that when sorting more than one column can finish in 1/2 the time, or when only needing to begin streaming the sorted data can finish in 1/2 the time (thus head), and can fork sorting jobs better (though neither does by default): but more often looses to sort's merge when sorting 1 column: it has opposite benefits of merge. Streaming and columns headsort(1) can being streaming in less than 1/2 the time. It's used when use columns and piping data are more often than not used.
distributive counting, straight radix,
radix exchange, quick, merge,
code that can be selected to run.
[[User:Navstar55|Navstar55]] ([[User talk:Navstar55|talk]]) 17:29, 10 May 2014 (UTC)
If you are interested in headsort(1) "1/2 the time" contact johnandsara2@cox.net or sven_nestle2 on wiki with subject "sort algorithm".
It's good to note that for top speed no algorithm is needed just memory: however quite impractically allot is need for any appreciable task especial where used for random tasks; such a thing is useable only within a single program.
== ok, let me try describe Euclid sort ==
| 