An Evil question in CLRS

 CLRS 可称作算法圣经。最近在重新温习。看到一个分享习题答案作者的吐槽。笑了。

Show that when all elements are distinct, the best-case running time ofHEAPSORTisΩ(nlgn).

http://clrs.skanev.com/06/04/05.html

This proved to be quite tricky. My initial solution was wrong. Also, heapsort appeared in 1964, but the lower bound was proved by Schaffer and Sedgewick in 1992. It's evil to put this an exercise.