+1. On Sat, Sep 10, 2011 at 7:58 PM, Dave <dave_and_da...@juno.com> wrote:
> @Praveen: The question should be "How can we find the second largest > element in an array in n + ceiling(log_2(n)) - 2 comparisons?" The > answer is to use a tournament to select the largest number. The second > largest number will have lost to one of the numbers that lost to the > largest. It takes n - 1 comparisons to determine the largest number. > There are ceiling(log_2(n)) numbers that have lost to the maximum, and > it takes ceiling(log_2(n)) - 1 comparisons to find the largest of > them. > > Dave > > On Sep 10, 9:18 am, praveen raj <praveen0...@gmail.com> wrote: > > How can we find second largest element in an array... in O(n > > +logn-2)... give me proof..... > > -- > 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. > > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.com <puneet.ar...@aricent.com> -- 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.
