6.4-5 ? Show that when all elements are distinct, the best-case running time of HEAPSORT is $\Omega(n lg n)$. This is abit complicated. i need to revisit. This is proved in a paper as the author mentions in the below article. http://stackoverflow.com/questions/4589988/lower-bound-on-heapsort
No comments:
Post a Comment