From:	mwood AT indyvax DOT iupui DOT edu (Mark H. Wood)
Newsgroups:	comp.os.msdos.djgpp
Subject:	Re: fastest sort for an almost sorted array?
Date:	1 Apr 98 13:31:38 -0500
Organization:	Indiana University - Purdue Univeristy At Indianapols,IN
Lines:	10
Message-ID:	<CfqXLzxdBR6r@indyvax.iupui.edu>
References:	<35223233 DOT 53AD6263 AT frw DOT ruu DOT nl>
NNTP-Posting-Host:	indyvax.iupui.edu
To:	djgpp AT delorie DOT com
DJ-Gateway:	from newsgroup comp.os.msdos.djgpp

I don't have my copy handy just now, but whenever you have a question like
this, first look in Donald Knuth's _The Art of Computer Programming_.  Knuth
does quite a lot of discussion of the tradeoffs between various algorithms
which all accomplish pretty much the same thing, but by widely divergent means.
Even if you come across an angorithm he hasn't analyzed, these books will help
you to ask the right questions to do the analysis yourself.
-- 
Mark H. Wood, Lead Systems Programmer    [@disclaimer@]
MWOOD AT IUPUI DOT EDU                          Finger for more information.
The rats won the first heat, but I'm not licked yet!

- Raw text -