Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!elroy.jpl.nasa.gov!decwrl!pa.dec.com!bacchus!mwm
From: mwm@pa.dec.com (Mike (My Watch Has Windows) Meyer)
Newsgroups: comp.sys.amiga.programmer
Subject: Re: Combsort algorithm
Message-ID: <MWM.91May7111453@raven.pa.dec.com>
Date: 7 May 91 18:14:53 GMT
References: <1193@cbmger.UUCP> <1991May3.201243.7959@watdragon.waterloo.edu>
	<1991May6.155148.1201@zorch.SF-Bay.ORG>
Sender: news@pa.dec.com (News)
Organization: Missionaria Phonibalonica
Lines: 17
In-Reply-To: xanthian@zorch.SF-Bay.ORG's message of 6 May 91 15:51:48 GMT

In article <1991May6.155148.1201@zorch.SF-Bay.ORG> xanthian@zorch.SF-Bay.ORG (Kent Paul Dolan) writes:
   While it does (barely) beat heapsort, it takes almost twice as long
   as quicksort, so it is still not a choice you'd make except in a small
   sort, quick hack application.

Actually, for that kind of application, I use sort(). What's the point
of having libraries of tools if you don't use them for the quick
hacks. In fact, even for non-quick hacks, it's probably worthwhile
using sort(), and replacing it if it proves to be unsuitable for some
reason.

	<mike
--
I know the world is flat.				Mike Meyer
Don't try tell me that it's round.			mwm@pa.dec.com
I know the world stands still.				decwrl!mwm
Don't try to make it turn around.