Article View: rec.games.programmer
Article #1070Re: Advice needed for fastest sort algorthm
From: John A. Slagel
Date: Tue, 10 Nov 1992 23:21
Date: Tue, 10 Nov 1992 23:21
20 lines
1434 bytes
1434 bytes
I know this is off the subject of QuickSort, etc, but... In one of my CS classes our teacher told us about a contest people had where you had to write the worst sort routine that was actually doing something... The winner was called the Neanderthal Sort, which can be explained by this: A caveman wants to sort some rocks. He throws them in the air, and then checks to see if they're in the right order. He continues this until they're in the right order. I guess they actually calculated all the timings for this, but I didn't catch that part. The best case is pretty good, though, since even for a badly ordered list, it could do it in 1 try. Anyway... -- ------------------------------------------------------------------------ John A. Slagel, email: jas37876@uxa.cso.uiuc.edu
Technical Details
Message-ID:
<BxIwwn.Hv6@news.cso.uiuc.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!ames!saimiri.primate.wisc.edu!sdd.hp.com!news.cs.indiana.edu!ux1.cso.uiuc.edu!news.cso.uiuc.edu!uxa.cso.uiuc.edu!jas37876References:
<1dj7cvINNdie@tartarus.uwa.edu.au> <lg04q0INNqhk@exodus.Eng.Sun.COM>Show Full Headers
Complete Article Headers
Newsgroups: rec.games.programmer Path: arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!ames!saimiri.primate.wisc.edu!sdd.hp.com!news.cs.indiana.edu!ux1.cso.uiuc.edu!news.cso.uiuc.edu!uxa.cso.uiuc.edu!jas37876 From: jas37876@uxa.cso.uiuc.edu (John A. Slagel) Subject: Re: Advice needed for fastest sort algorthm References: <1dj7cvINNdie@tartarus.uwa.edu.au> <lg04q0INNqhk@exodus.Eng.Sun.COM> Message-ID: <BxIwwn.Hv6@news.cso.uiuc.edu> Sender: usenet@news.cso.uiuc.edu (Net Noise owner) Organization: University of Illinois at Urbana Date: Tue, 10 Nov 1992 23:21:58 GMT Lines: 20