Hi all,

I published a new thread to the wrong forum:

Quicksort with duplicate values

I meant it to be for 3d edition, not 2d.
If anybody could move it to this forum that would be great?

Anyway, feel free to react!

Thanks

Olivier

In my tests the implementation on pp 128-29 works fine when there are duplicated values. If there are duplicates of the pivot value, they end up in the right (rather than left) partition.

If you're seeing different behavior than this, can you post an input that reproduces the failure? (And describe the nature of the failure: array returned in unsorted order, infinite recursion, etc.?)

John

Yes, it's almost a year later... but better late then never!

I agree with you John, I misinterpreted the algorithm in the book, it's perfectly fine.
I will post a fix of my own code in the other thread.

Thanks for replying!