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.3 required=5.0 tests=BAYES_00,MAILING_LIST_MULTI, REPLYTO_WITHOUT_TO_CC autolearn=no 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 10:22:04 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!fr.usenet-edu.net!usenet-edu.net!enst!enst.fr!not-for-mail From: Wilhelm Spickermann Newsgroups: comp.lang.ada Subject: Re: Smart sorting algorithm ? Date: Tue, 02 Jul 2002 19:21:18 +0200 Organization: ENST, France Sender: comp.lang.ada-admin@ada.eu.org Message-ID: References: <3D21D581.6EF6CB06@despammed.com> Reply-To: comp.lang.ada@ada.eu.org NNTP-Posting-Host: marvin.enst.fr Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Trace: avanie.enst.fr 1025630524 39789 137.194.161.2 (2 Jul 2002 17:22:03 GMT) X-Complaints-To: usenet@enst.fr NNTP-Posting-Date: Tue, 2 Jul 2002 17:22:03 +0000 (UTC) Return-Path: In-Reply-To: <3D21D581.6EF6CB06@despammed.com> X-Mailer: Mulberry/2.2.1 (Linux/x86) Content-Disposition: inline Errors-To: comp.lang.ada-admin@ada.eu.org X-BeenThere: comp.lang.ada@ada.eu.org X-Mailman-Version: 2.0.11 Precedence: bulk List-Help: List-Post: List-Subscribe: , List-Id: comp.lang.ada mail<->news gateway List-Unsubscribe: , Errors-To: comp.lang.ada-admin@ada.eu.org X-BeenThere: comp.lang.ada@ada.eu.org Xref: archiver1.google.com comp.lang.ada:26810 Date: 2002-07-02T19:21:18+02:00 --Am Dienstag, Juli 02, 2002 11:32:01 -0500 schrieb Wes Groleau : > > Anyone know anything about a sorting algorithm > that includes the ability to infer the answer > to a comparison from comparisons already done? > > The reason I'm asking is that I have a situation > where deciding the order of two items is very slow. > > If the program determines that A < B and later > determines that B < C and stores this information, > then if and when A ? C comes up, it can determine > the answer from the stored information. > > I have ideas for two ways to do this, but > if it's already been done..... > Hi, have a look into D.E.Knuth: The Art of Computer Programming, Vol 3: Sorting and Searching. Subsection 5.3.1: Minimum Comparison Sorting. Wilhelm