Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!samsung!uunet!mcsun!hp4nl!cbmnlux!cbmehq!cbmger!peterk
From: peterk@cbmger.UUCP (Peter Kittel GERMANY)
Newsgroups: comp.sys.amiga.programmer
Subject: Combsort algorithm
Keywords: sorting, Combsort
Message-ID: <1193@cbmger.UUCP>
Date: 2 May 91 12:09:55 GMT
Organization: Commodore Bueromaschinen GmbH, West Germany
Lines: 19

Anybody read the April Byte and the article about the new Combsort
algorithm? Recommended to everyone. Not only that it's a pure miracle
how one can achieve such a performance with such a little beastie
(you take bubble sort and *add two lines* and *change one other line*).
ABSOLUTELY INCREDIBLE.
But, for the best, if you look closely into one of the explanation
boxes, you find all this research (they obviously did an awful lot)
was done on an A2000.

I also thought at first, be careful it's the April issue, but I
immediately tested it and it seems to work, flawlessly and blindingly
fast. It looks as if it will replace my old loved heapsort that I used
the last years (I hate recursive algorithms like quicksort), because
Combsort beats Heapsort by a factor of 33 % on my machine (e.g. 12 s
against 16 s).

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