On Wednesday, 7 September 2011 09:41:53 UTC+5:30, Anup 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 view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/zg3SeePrmzYJ. 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.
