From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=0.1 required=3.0 tests=BAYES_05,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.5-pre1
Date: Fri, 3 Sep 93 10:23:08 EDT
From: peju@starkad.research.att.com (Peter Juhl)
Subject: Sorting
Message-ID: <9309031423.AA00253@starkad.research.att.com.research.att.com >
List-Id: <comp.lang.ada>

I ppologize for posting directly to info-ada-request, Colin James's 
answer to me has not come up on comp.lang.ada 


I don't have the time or inclination to go into a long debate about the
finer points of sorting. This subject calls for great experience and
insight so it's not suitable for a net debate. I recommend the
references in my previous post.

Another interesting reference is J.L Bentley, B.W. Kernighan and C.J.
Van Wyk, An Elementary C Cost Model, Unix Review 9(2), pp 38-48,
February 1991; it gives a better cost-model for elementary operations
than the MIX model. The MIX model reflects the machine architectures of
the 60'ies.

--- peter (peju@research.att.com)

ps. When consulting Knuth please remember that he analyses the
algorithms for 3 digit numeric keys only (vol3 pg 381); different keys
give different cost characteristics