Building a max heap takes O(n) time irrespective of the array being sorted /
unsorted.
Can someone prove that. I already know that Heap can be constucted in
o(n*log(n)) time.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
Read CLRS
On Thu, Sep 15, 2011 at 11:51 PM, saurabh agrawal saurabh...@gmail.comwrote:
Building a max heap takes O(n) time irrespective of the array being sorted
/ unsorted.
Can someone prove that. I already know that Heap can be constucted in
o(n*log(n)) time.
--
You received this
