Path: utzoo!utgpu!watserv1!watmath!att!att!linac!pacific.mps.ohio-state.edu!zaphod.mps.ohio-state.edu!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.030108.2653@bushido.uucp>
Date: 18 Nov 90 03:01:08 GMT
References: <6913:Nov1008:23:5690@kramden.acf.nyu.edu> <235@smds.UUCP> <16709:Nov1113:56:2390@kramden.acf.nyu.edu> <36568@nigel.ee.udel.edu>
Organization: Bushido Systems of Ann Arbor, Michigan.
Lines: 10

.Actually, for sorting to be linear in the number of bytes sorted, don't
.you need some opperation on the keys other than comparison?  For

Yes.  For many (most, all) problems that isn't hard.  Dan has consistently
repeatedly, over and over again stated that that wasn't the model he was
using; he just doesn't compare keys.


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