From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,385be4c68a9e4de6 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-07-02 13:32:18 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!skynet.be!skynet.be!bnewspeer01.bru.ops.eu.uu.net!lnewspeer00.lnd.ops.eu.uu.net!emea.uu.net!news.kvaerner.com!news@kvaerner.com From: "Tarjei T. Jensen" Newsgroups: comp.lang.ada Subject: Re: Smart sorting algorithm ? Date: Tue, 2 Jul 2002 22:22:29 +0200 Organization: KOGAS Message-ID: References: <3D21D581.6EF6CB06@despammed.com> <3D220691.26F596F2@despammed.com> NNTP-Posting-Host: 155.209.162.149 Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 Xref: archiver1.google.com comp.lang.ada:26821 Date: 2002-07-02T22:22:29+02:00 List-Id: Wes Groleau wrote: > > have a look into D.E.Knuth: The Art of Computer Programming, Vol > > 3: Sorting and Searching. Subsection 5.3.1: Minimum Comparison > > Sorting. > > Thanks, I will do that if I can find it. > (I got volume one at a garage sale, and > I've never seen any of the others anywhere.) Knuth is an excellent example of a bit twiddler in action. As far as I'm concerned the point gets lost in a sea of details written in mix. greetings,