Path: utzoo!utgpu!watserv1!watmath!att!att!linac!pacific.mps.ohio-state.edu!zaphod.mps.ohio-state.edu!sdd.hp.com!caen!umich!bushido!dbc
From: dbc@bushido.uucp (Dave Caswell)
Newsgroups: comp.lang.misc
Subject: Re: A very brief history of optimal sorting methods
Message-ID: <1990Nov18.025036.2498@bushido.uucp>
Date: 18 Nov 90 02:50:36 GMT
References: <16709:Nov1113:56:2390@kramden.acf.nyu.edu> <5812@lanl.gov> <4440:Nov1405:06:2590@kramden.acf.nyu.edu>
Organization: Bushido Systems of Ann Arbor, Michigan.
Lines: 10

.
.In the very common case that keys are not all distinct, radix sort can
.be asymptotically FASTER than n log n, depending on the amount of
.repetition. 

Shouldn't this be "keys are not all the same"?


-- 
David Caswell                             dbc%bushido.uucp@umich.edu