Quicksort vs. Heapsort

Article View: comp.lang.modula2

Article #275

#275

From: Michael Rys
Date: Wed, 20 Sep 1989 15:00

17 lines
1186 bytes

A little bit late, but...

In 1987 a guy called Carlson (I think) improved the Heapsort-Algorithm
by using a binary search for inserting into the sorted list. In this
way Heapsort is always faster than Quicksort for very larg n.

Cheers.../Michael

+---------------------------------------------------------------+
| Michael Rys, V. Conzett Str. 34; CH-8004 Zuerich; Switzerland |
+---------------------------------------------------------------+
| UUCP:  mrys@ethz.UUCP or       EAN:     mrys@ifi.ethz.ch	|
|        mrys@bernina.UUCP       IPSANet: mrys@ipsaint		|
| Voice: +41 1 242 35 87					|
+---------------------------------------------------------------+
-- Wovon man nicht sprechen kann, darueber muss man schweigen. --
       Ludwig Wittgenstein, Tractatus logico-philosophicus

Technical Details

Message-ID: <2033@ethz.UUCP>

Path:

arc1-ca.pugleaf.net!utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!wuarchive!brutus.cs.uiuc.edu!lll-winken!uunet!mcsun!cernvax!ethz!mrys

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!wuarchive!brutus.cs.uiuc.edu!lll-winken!uunet!mcsun!cernvax!ethz!mrys
From: mrys@ethz.UUCP (Michael Rys)
Newsgroups: comp.lang.modula2
Subject: Quicksort vs. Heapsort
Message-ID: <2033@ethz.UUCP>
Date: 20 Sep 89 15:00:40 GMT
Reply-To: mrys@ethz.UUCP (Michael Rys)
Organization: ETH Zuerich, Switzerland
Lines: 17