Path: utzoo!attcan!uunet!cs.utexas.edu!yale!cmcl2!kramden.acf.nyu.edu!brnstnd
From: brnstnd@kramden.acf.nyu.edu (Dan Bernstein)
Newsgroups: comp.lang.misc
Subject: Re: A very brief history of optimal sorting methods
Message-ID: <24823:Nov1218:52:0990@kramden.acf.nyu.edu>
Date: 12 Nov 90 18:52:09 GMT
References: <6913:Nov1008:23:5690@kramden.acf.nyu.edu> <16709:Nov1113:56:2390@kramden.acf.nyu.edu> <237@smds.UUCP>
Organization: IR
Lines: 8

In article <237@smds.UUCP> rh@smds.UUCP (Richard Harter) writes:
> If you do a radix sort
> you make multiple passes over the data.  In each pass you move all of the
> records.

Wrong.

---Dan