Re: Advice needed for fastest sort algorthm

Article View: rec.games.programmer

Article #1062

Back to rec.games.programmer Previous Next

#1062

From: Warwick Allison
Date: Wed, 11 Nov 1992 00:31

19 lines
1231 bytes

dstampe@psych.toronto.edu (Dave Stampe) writes:

>If you are sorting 6 or less items, I'd still use something like an
>insert or bubble sort, because the overhead is less (no recursion).

Groan.  Recursion costs insignificantly more than iteration for most
applications, more for some, less for others.  Will ASM hackers ever
know anything?  I suppose you'll inline the comparison too?  Write the
whole thing as a macro perhaps?  Come one!  The time taken to draw
up your sorted objects will TOTALLY DWARF you sorting time.

--
Warwick
--
  _-_|\      warwick@cs.uq.oz.au            /Disclaimer:
 /     * <-- Computer Science Department,  /  
 \_.-._/     University of Queensland,    /   C references are NULL && void*
      v      Brisbane, Australia.        /

Technical Details

Message-ID: <10990@uqcspe.cs.uq.oz.au>

Path: arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!bunyip.cc.uq.oz.au!uqcspe!cs.uq.oz.au!warwick

References: <SCD.92Nov7223729@nevar.cs.brown.edu> <1992Nov8.141848.10162@psych.toronto.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!bunyip.cc.uq.oz.au!uqcspe!cs.uq.oz.au!warwick
From: warwick@cs.uq.oz.au (Warwick Allison)
Newsgroups: rec.games.programmer
Subject: Re: Advice needed for fastest sort algorthm
Message-ID: <10990@uqcspe.cs.uq.oz.au>
Date: 11 Nov 92 00:31:18 GMT
References: <SCD.92Nov7223729@nevar.cs.brown.edu> <1992Nov8.141848.10162@psych.toronto.edu>
Sender: news@cs.uq.oz.au
Reply-To: warwick@cs.uq.oz.au
Lines: 19

Reply to Parent Message