Re: Advice needed for fastest sort algorthm

Article View: rec.games.programmer

Article #1050

Back to rec.games.programmer Previous Next

#1050

From: Court Demas
Date: Tue, 10 Nov 1992 10:36

8 lines
886 bytes

Well, quicksort is generally the fastest general algorithm on large data sets.
But, if you are dealing with only a small number of items, or especially a list
which is almost sorted already, something like an insertion sort might be
better.  Most O(nlogn) algorithms have a bit too much overhead on small lists,
and insertion sort is one of the simplest and fastest O(n^2) sorts.

-court

Technical Details

Message-ID: <sezt34W00Vpg4K0_R2@andrew.cmu.edu>

Path:

arc1-ca.pugleaf.net!sparky!uunet!usc!sdd.hp.com!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!cis.ohio-state.edu!news.sei.cmu.edu!fs7.ece.cmu.edu!crabapple.srv.cs.cmu.edu!andrew.cmu.edu!cd2a+

Show Full Headers

Complete Article Headers

Organization: Junior, Math/Computer Science, Carnegie Mellon, Pittsburgh, PA
Path: arc1-ca.pugleaf.net!sparky!uunet!usc!sdd.hp.com!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!cis.ohio-state.edu!news.sei.cmu.edu!fs7.ece.cmu.edu!crabapple.srv.cs.cmu.edu!andrew.cmu.edu!cd2a+
Newsgroups: rec.games.programmer
Message-ID: <sezt34W00Vpg4K0_R2@andrew.cmu.edu>
Date: Tue, 10 Nov 1992 05:36:52 -0500 
From: Court Demas <court+@CMU.EDU>
Subject: Re: Advice needed for fastest sort algorthm
Lines: 8