@all..Well I am no expert but my logic says its impossible to pick the best unless and untill you look at each and every individual.Isn't this logic enough?
On Tue, Dec 13, 2011 at 12:32 AM, Ankur Garg <ankurga...@gmail.com> wrote: > By Max Heapify I thought u meant to say u are making a Max Heap .. In case > you use Coreman Definition Of max Heapify it just heapifies assuming the > heap has been formed, But u need to make a max Heap first dude :) > > P.S-> Clarify your concepts before posting the link :( > > > On Tue, Dec 13, 2011 at 12:11 AM, Dipit Grover <dipitgro...@gmail.com>wrote: > >> ^it cant get better than O(n) apparently. Just applying max-heapify once >> would not yield the max element. You need to construct a heap for it, which >> is no less than O(n). >> >> -- >> 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. >> > > -- > 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. > -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- 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.
