Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!uunet!munnari.oz.au!basser!steve
From: steve@basser.oz (Stephen Russell)
Newsgroups: comp.lang.modula2
Subject: Re: Quicksort vs. Heapsort
Message-ID: <2590@basser.oz>
Date: 2 Oct 89 12:13:38 GMT
References: <828zebolskyd@yvax.byu.edu> <2585@basser.oz> <4287@mentor.cc.purdue.edu>
Organization: Dept of Comp Sci, Uni of Sydney, Australia
Lines: 14

In article <4287@mentor.cc.purdue.edu> ags@mentor.cc.purdue.edu (Dave Seaman) writes:
>In article <2585@basser.oz> steve@basser.oz (Stephen Russell) writes:
>>I'm going to feel a real fool if I get this wrong, but ... 

Well, I was wrong, and I'm feeling quite foolish, really ... :-)

Dave's explanation of the technique of performing a binary search to
find the correct insertion point along the path to the new leaf is very
clear. This is a technique I've never seen before, though having been shown
it so clearly by Dave, I'm amazed how `obvious' it is.

Well, we learn something new every day. Thanks, Dave, much appreciated.
(BTW, I found your node's name "mentor" particularly apropos to this
situation.)