Posted by Lil' Viv on July 23, 2001 at 05:33:36:
In Reply to: Re: problem 6.2B posted by kalpol on July 22, 2001 at 23:09:47:
: : does anyone know what this question is asking us to do?
: : thanks
: use the heapsort method instead of the insertion -one-by-one method to make a heap.
Hmmmm . . . I thought we were just supposed to assume we had those values inserted into the array (heap) in the order they were given, then show how our buildheap function could fix it into a heap in linear time . . . basically . . . it just percolates from the end to the front downwards, right?