In place quick sort pseudo code?

Asked Oct 27 '14 at 01:21

Active Oct 27 '14 at 01:29

Viewed 414 times

I'm trying to come up with a pseudocode description of the in-place version of quick-sort that is specialized to take an array as input and return that same array as output. In this version the array may have duplicate elements. (That is, the elements may not be unique).

Any suggestions on what the pseudo code would look like?

edited Oct 27 '14 at 01:29

asked Oct 27 '14 at 01:21

Vimzy

1,871
8
30
56

Is pseudocode for Java different than normal pseudocode? – Chris Martin Oct 27 '14 at 01:24
@ChrisMartin sorry, pseudocode in general I meant! – Vimzy Oct 27 '14 at 01:29
I think http://rosettacode.org/wiki/Quicksort has what you're looking for? – Chris Martin Oct 27 '14 at 01:34
@ChrisMartin I think that might be it, but does it work with duplicate values like I described in my problem description? A bit new to these sorting algorithms, so please excuse the stupid questions! – Vimzy Oct 27 '14 at 01:46
Yes, that's essentially what ["weak order"](https://en.wikipedia.org/wiki/Weak_ordering) means in the summary. – Chris Martin Oct 27 '14 at 01:50

In place quick sort pseudo code?

0 Answers0