Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!usc!samsung!emory!hubcap!svissag
From: svissag@hubcap.clemson.edu (Steve L Vissage II)
Newsgroups: comp.lang.misc
Subject: Re: A very brief history of optimal sorting methods
Message-ID: <11576@hubcap.clemson.edu>
Date: 13 Nov 90 17:06:01 GMT
References: <24945:Nov1218:54:5590@kramden.acf.nyu.edu>
Organization: Clemson University, Clemson, SC
Lines: 13

From article <24945:Nov1218:54:5590@kramden.acf.nyu.edu>, by brnstnd@kramden.acf.nyu.edu (Dan Bernstein):
> A *crude* radix sort would not do for any serious application.
> 
> A *good* radix sort is linear in the number of bytes being sorted.

I've never heard of radix sort.  Could someone please send me some source?
Preferably a *good* radix sort.  :-)

> ---Dan
 
Thanks,
Steve L Vissag II
svissag@hubcap.clemson.edu