How is quick sort working? - Cracking the Java Coding Interview

Cracking the #Java #Coding #Interview - Question 150: How is quick sort working?

[bentels]

And that's true unless you're Dutch. Then you divide into three parts: less than the pivot, equal to the pivot and greater than the pivot. Repeat recursively on the less than and greater than parts; the equal to part is already sorted.

Called the Dutch National Flag strategy, developed by E. W. Dijkstra. Original, two subset partition quicksort developed by C.A.R. Hoare.