check the case 63 62 46 71 28 39 43 24 36 12 You have to find 3rd largest 62
your case you will miss 62 in your first iteration On Wed, Sep 7, 2011 at 9:41 AM, Anup Ghatage <ghat...@gmail.com> wrote: > Here is another one. Pardon me if it goes by some other name. > > Divide the array in K parts. > > Find the Maximum in each of these parts and store it in an array of size K. > > Find the Minimum in K to find the K'th max. > > Total Time Complexity = O ( n + k ) where 0 <= k <= n > > -- > Anup Ghatage > > -- > 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.
