>
>
> >I don't believe the data is almost-sorted.
> On a random sample, heap sort's performance is same
> or better than that of quick sort. The real difference
> shows up in a reasonably ordered data set.
Can you remind me what heapsort does?
- --
Bruce Momjian
maillist@candle.pha.pa.us
------------------------------