hey this question was discussed earlier rite???pls make use of Selection algorithm...i think the worst case is O(n+logn)..... http://en.wikipedia.org/wiki/Selection_algorithm
On Thu, Jul 22, 2010 at 9:53 PM, Tech Id <tech.login....@gmail.com> wrote: > Write an algo (in less than O(n^2)) to find k-th maximum in an > unsorted array of integers. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- yezhu malai vaasa venkataramana Govinda Govinda -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
