Why is the top down approach of heap construction less efficient than bottom up even though its order of growth is lower O(log n) over O(n)?
<p>How is the bottom up approach of heap construction of the order O(n) ? Anany Levitin says in his book that this is more efficient compared to top down approach which is of order O(log n). Why?</p>