is talks of more tighter bound of O(nlogn) On Sep 15, 11:24 pm, sunny agrawal <sunny816.i...@gmail.com> wrote: > Read CLRS .... > > On Thu, Sep 15, 2011 at 11:51 PM, saurabh agrawal <saurabh...@gmail.com>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 algogeeks@googlegroups.com. > > To unsubscribe from this group, send email to > > algogeeks+unsubscr...@googlegroups.com. > > 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
