first do quick sort . ie (nlog n) then find kth largest/smallest . On Sun, Sep 4, 2011 at 6:28 PM, learner <nimish7andr...@gmail.com> wrote:
> something I Know using quick sort randomization function we can find > kt smallest/largest in unsorted array , but i am not able to write > code , please help me in this and provide the code for the same.? > > > Thanks > Nimish K. > 1st Year > IITR > > -- > 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.
