PLEASE TELL ME HOW WE CAN USE QUICK SORT TO FIND THE ELEMENT BECAUSE IN QUICK SORT ONE ELEMENT IN SHIFT IN ITS RIGHT POSITION ALL LEFTS ARE SMALLER AND ALL RIGHT ARE BIG
On Mon, Sep 5, 2011 at POSIT11:55 AM, sachin goyal <[email protected]>wrote: > PLEASE TELL HOW > > > On Sun, Sep 4, 2011 at 7:23 PM, sarath prasath <[email protected]>wrote: > >> another sol which i learned from my friend is >> think of heap sort... >> >> On Sun, Sep 4, 2011 at 6:28 PM, learner <[email protected]> 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 [email protected]. >>> To unsubscribe from this group, send email to >>> [email protected]. >>> 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 [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
