comp.lang.ada
 help / color / mirror / Atom feed
* Sorting
@ 1993-09-03 14:23 Peter Juhl
  0 siblings, 0 replies; only message in thread
From: Peter Juhl @ 1993-09-03 14:23 UTC (permalink / raw)


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

^ permalink raw reply	[flat|nested] only message in thread

only message in thread, other threads:[~1993-09-03 14:23 UTC | newest]

Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1993-09-03 14:23 Sorting Peter Juhl

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox