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 00:52:04 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!netnews.com!xfer02.netnews.com!news.tufts.edu!uunet!dca.uu.net!prodigy.com!newsmst01.news.prodigy.com!prodigy.com!postmaster.news.prodigy.com!newssvr13.news.prodigy.com.POSTED!3bae8248!not-for-mail From: tmoran@acm.org Newsgroups: comp.lang.ada Subject: Re: Smart sorting algorithm ? References: <3D2A0A25.52A62B7C@despammed.com> X-Newsreader: Tom's custom newsreader Message-ID: NNTP-Posting-Host: 64.175.242.70 X-Complaints-To: abuse@prodigy.net X-Trace: newssvr13.news.prodigy.com 1026201075 ST000 64.175.242.70 (Tue, 09 Jul 2002 03:51:15 EDT) NNTP-Posting-Date: Tue, 09 Jul 2002 03:51:15 EDT Organization: Prodigy Internet http://www.prodigy.com X-UserInfo1: FKPO@MONAJUMB_LY@BCBNWX@RJ_XPDLMN@GZ_GYO^ZUDUWYAKVUOPCW[ML\JXUCKVFDYZKBMSFX^OMSAFNTINTDDMVW[X\THOPXZRVOCJTUTPC\_JSBVX\KAOTBAJBVMZTYAKMNLDI_MFDSSOLXINH__FS^\WQGHGI^C@E[A_CF\AQLDQ\BTMPLDFNVUQ_VM Date: Tue, 09 Jul 2002 07:51:15 GMT Xref: archiver1.google.com comp.lang.ada:26959 Date: 2002-07-09T07:51:15+00:00 List-Id: > I solved this part. Wrote an "<" that > first checks a 2D lookup table. If the > answer is "unknown" it does the comparison, > then updates as many cells in the table as > possible. Once you compare A & B, you may Though it's a rather different data structure, it sounds like it will probably do the same comparisons as building a binary tree, which is not good if your data might arrive already in order.