Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!cs.utexas.edu!uunet!munnari.oz.au!murtoa.cs.mu.oz.au!ditmela!yarra!bohra!ejp
From: ejp@bohra.cpg.oz (Esmond Pitt)
Newsgroups: comp.theory
Subject: revised heapsort
Message-ID: <110@bohra.cpg.oz>
Date: 9 Nov 89 23:27:24 GMT
Reply-To: ejp@bohra.cpg.oz (Esmond Pitt)
Organization: Computer Power Group, Melb, Australia
Lines: 17

A while ago on (I believe) this newsgroup, there was a discussion of a
revised heapsort algorithm, published in 1987 or 1988, using a binary
search over the path to the leaf node.

Unfortunately I have wiped my copies of the discussion. Could some kind
soul please either

	(a) mail me the gist, or better still the article(s),
	(b) provide me with further information, or at least
	(c) cite the reference.

Thank you very much.


-- 
Esmond Pitt, Computer Power Group
ejp@bohra.cpg.oz