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-09 11:59:28 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed1.cidera.com!Cidera!cyclone.socal.rr.com!cyclone3.kc.rr.com!news3.kc.rr.com!twister.socal.rr.com.POSTED!not-for-mail From: "Ron" Newsgroups: comp.lang.ada References: <3D21D581.6EF6CB06@despammed.com> <3D2A0A25.52A62B7C@despammed.com> Subject: Re: Smart sorting algorithm ? X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 5.50.4807.1700 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4807.1700 Message-ID: Date: Tue, 09 Jul 2002 18:59:26 GMT NNTP-Posting-Host: 24.30.156.163 X-Complaints-To: abuse@rr.com X-Trace: twister.socal.rr.com 1026241166 24.30.156.163 (Tue, 09 Jul 2002 11:59:26 PDT) NNTP-Posting-Date: Tue, 09 Jul 2002 11:59:26 PDT Organization: RoadRunner - West Xref: archiver1.google.com comp.lang.ada:26974 Date: 2002-07-09T18:59:26+00:00 List-Id: "Wes Groleau" : > Wrote an "<" that > first checks a 2D lookup table. I mentioned earlier that you should investigate non-comparison-based sorting. If you can easily create a lookup table, then you should easily be able to create such a sorting algorithm. O(n) and O(1) comparison sorting is possible under special circumstances... - Ron Zeno