@gaurav... how?? With regards,
Praveen Raj DCE-IT 3rd yr 9999735993 praveen0...@gmail.com On Sat, Sep 10, 2011 at 7:49 PM, Gaurav Menghani <gaurav.mengh...@gmail.com>wrote: > It can be done trivially in O(n). > > On Sat, Sep 10, 2011 at 10: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. > > > > > > > > -- > Gaurav Menghani > > -- > 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.
