use the references, sort it & then move the statues. no intermediate moves...like it shudnt be.moving a to b & then to c...
On Sun, Aug 21, 2011 at 12:33 AM, sagar pareek <[email protected]>wrote: > I am just asking what actual solution wants to convey? > > > On Sun, Aug 21, 2011 at 12:32 AM, sagar pareek <[email protected]>wrote: > >> *The statues are >> very heavy and you want to move them the least possible distance.* >> >> On Sun, Aug 21, 2011 at 12:31 AM, priya ramesh < >> [email protected]> wrote: >> >>> in quick sort the pivot is positioned to it's proper position. (no >>> intermediate swaps) >>> >>> -- >>> 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. >>> >> >> >> >> -- >> **Regards >> SAGAR PAREEK >> COMPUTER SCIENCE AND ENGINEERING >> NIT ALLAHABAD >> >> > > > -- > **Regards > SAGAR PAREEK > COMPUTER SCIENCE AND ENGINEERING > NIT ALLAHABAD > > -- > 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.
