0 votes 0 votes Show that when all elements are distinct, the best-case running time of HEAPSORT is $\Omega(n\lg\ n)$. Algorithms cormen algorithms binary-heap heap-sort descriptive difficult + – akash.dinkar12 asked Jun 27, 2019 akash.dinkar12 307 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.