Re: Advice needed for fastest sort algorthm

Article View: rec.games.programmer

Article #1158

Back to rec.games.programmer Previous Next

#1158

From: Russ Trotter
Date: Wed, 11 Nov 1992 16:10

15 lines
1053 bytes

I hate to jump on this seemingly runaway train but.... 

In one of my classes, I remember the teacher saying that it
had been proven that O(n log n) was the best one could do
for _comparison_ based sorting...  Is this a more correct assertion?

I don't know much (at all :) ) about Radix sort  (only how to spell it :) )
so I can't be sure if it disproves the statement above.


I've seen posts flying back and forth about this and quite frankly
I'm getting a bit confused...

Russ
asu@panther.mot.com

Technical Details

Message-ID: <1992Nov11.161052.5552@panther.mot.com>

Path: arc1-ca.pugleaf.net!sparky!uunet!panther!panther4.panther.mot.com!asu

References: <BxG0MC.7yK@chinet.chi.il.us> <10991@uqcspe.cs.uq.oz.au> <1992Nov11.043526.26732@netcom.com>

Show Full Headers

Complete Article Headers

Newsgroups: rec.games.programmer
Path: arc1-ca.pugleaf.net!sparky!uunet!panther!panther4.panther.mot.com!asu
From: asu@panther4.panther.mot.com (Russ Trotter)
Subject: Re: Advice needed for fastest sort algorthm
Message-ID: <1992Nov11.161052.5552@panther.mot.com>
Sender: usenet@panther.mot.com
Nntp-Posting-Host: panther4.panther.mot.com
Organization: Motorola Panther Project, Chandler, AZ
References: <BxG0MC.7yK@chinet.chi.il.us> <10991@uqcspe.cs.uq.oz.au> <1992Nov11.043526.26732@netcom.com>
Date: Wed, 11 Nov 1992 16:10:52 GMT
Lines: 17

Reply to Parent Message