Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wuarchive!uunet!mcsun!hp4nl!cbmnlux!cbmehq!cbmger!peterk
From: peterk@cbmger.UUCP (Peter Kittel GERMANY)
Newsgroups: comp.sys.amiga.programmer
Subject: Re: Combsort algorithm
Keywords: sorting, Combsort
Message-ID: <1203@cbmger.UUCP>
Date: 6 May 91 08:07:17 GMT
References: <1193@cbmger.UUCP> <1991May3.201243.7959@watdragon.waterloo.edu>
Reply-To: peterk@cbmger.UUCP (Peter Kittel GERMANY)
Organization: Commodore Bueromaschinen GmbH, West Germany
Lines: 10

In article <1991May3.201243.7959@watdragon.waterloo.edu> ccplumb@rose.waterloo.edu (Colin Plumb) writes:
>I saw it briefly and was thrilled that BYTE had finally discovered shellsort.
>If it beats heapsort, though, I may be wrong.  How does it work?

In the article, they explicitly mention shellsort. They say that their
combsort may look very similar, but is quite a different thing then.

-- 
Best regards, Dr. Peter Kittel  // E-Mail to  \\  Only my personal opinions... 
Commodore Frankfurt, Germany  \X/ {uunet|pyramid|rutgers}!cbmvax!cbmger!peterk