http://en.wikipedia.org/wiki/Binary_heap#Building_a_heap
The algorithm of heap-building presented in most books is O(n).
On 2011-9-16 12:52, Ankuj Gupta wrote:
is talks of more tighter bound of O(nlogn)
On Sep 15, 11:24 pm, sunny agrawal<[email protected]> wrote:
Read CLRS ....
On Thu, Sep 15, 2011 at 11:51 PM, saurabh agrawal<[email protected]>wrote:
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 group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Sunny Aggrawal
B.Tech. V year,CSI
Indian Institute Of Technology,Roorkee
--
You received this message because you are subscribed to the Google Groups "Algorithm
Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
