Alexa version of sort with NlogM merge

Lars Clausen <[email protected]> Mon, 29 Dec 2003 16:23:49 +0100
Newsgroups gmane.comp.gnu.textutils.bugs
Organization Statsbiblioteket
Message-ID <1072711429.1906.48.camel@pc770>
--Boundary_(ID_RmdUMG6FGKuDgrWk12P/xg)
Content-type: text/plain
Content-transfer-encoding: QUOTED-PRINTABLE

Hi!

We got a copy of a derivation of the GNU sort(3) program from Alexa.
They've done some improvements to handle large collections of files
better, it seems, and use a specialized qsort.  But most interestingl=
y,
they have a merging algorithm that's O(N*log(M)) rather than O(N*M),
where N is the number of lines output, and M is the number of input
files.  You may want to consider that part for addition to future
versions of sort().

I'm attaching the source (too much has been specialized for diff to b=
e
useful), which includes the standard GNU header.  If you want to cont=
act
the author before looking at the source, it's [email protected].  Hope t=
his
is useful.

-Lars


--Boundary_(ID_RmdUMG6FGKuDgrWk12P/xg)
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

_______________________________________________
Bug-textutils mailing list
[email protected]
http://mail.gnu.org/mailman/listinfo/bug-textutils

--Boundary_(ID_RmdUMG6FGKuDgrWk12P/xg)--