[Date Prev][Date Next][Thread Prev][Thread Next]
[Date Index]
[Thread Index]
- Subject: Re: lhs and rhs in table.sort
- From: Dirk Laurie <dirk.laurie@...>
- Date: Thu, 27 Aug 2015 21:49:10 +0200
2015-08-27 17:55 GMT+02:00 Coda Highland <chighland@gmail.com>:
> I'm not sure about heap sort.
Heap sort has best case, average case, worst case, all O(n log n),
only the multipliers differ. Auxiliary storage O(1). See Nijenhuis and
Wilf's book, available online [1].
[1] http://www.math.upenn.edu/%7Ewilf/website/CombAlgDownld.html
