Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!elroy.jpl.nasa.gov!sdd.hp.com!wuarchive!udel!rochester!rutgers!cbmvax!peter
From: peter@cbmvax.commodore.com (Peter Cherna)
Newsgroups: comp.sys.amiga.programmer
Subject: Re: Combsort algorithm
Keywords: sorting, Combsort
Message-ID: <21342@cbmvax.commodore.com>
Date: 7 May 91 15:46:23 GMT
References: <1193@cbmger.UUCP> <1991May3.201243.7959@watdragon.waterloo.edu> <1991May6.155148.1201@zorch.SF-Bay.ORG>
Reply-To: peter@cbmvax.commodore.com (Peter Cherna)
Organization: Commodore-Amiga, Inc.  West Chester, PA.
Lines: 23

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.  As a recent net posting showing
>quicksort in ML proved, there is nothing inherently complex about
>quicksort, our notation for programming just makes it look complex
>with a lanugage as weak as C.

Quicksort is even easier to "write" when you find it has already
been implemented in a link-library.  SAS/C comes with a quicksort
that has several interfaces (one for integers, one for strings, etc.)
Other compilers may have the same.  (It's worth reading through
the section of the manual on the link libraries -- there are a really
rich set of functions available.)

>Kent, the man from xanth.

     Peter
--
Peter Cherna, Operating Systems Development Group, Commodore-Amiga, Inc.
{uunet|rutgers}!cbmvax!peter    peter@cbmvax.commodore.com
My opinions do not necessarily represent the opinions of my employer.
"If all you have is a hammer, everything looks like a nail."