in reply to Re^3: quicksort implementation
in thread quicksort implementation

will tell you all my idea i want to chosse pivot element and iterate , compare and hence that pivot elelment will be in its final position in terms of index of array i want to store this array indexes in hash and than alues and finally print hash indexes and values sorted I want to know your feedback, I will start implementing this after i hear from PM's thanks

Replies are listed 'Best First'.
Re^5: quicksort implementation
by Anonymous Monk on Oct 06, 2011 at 02:37 UTC
    I think that won't work -- you have 3 implementations, pick one, copy, paste
[reply]

In Section Seekers of Perl Wisdom