I've seen to explanations for the quick sort algorithm.
One in which a pivot is chosen, and put into place, before both sides of the pivot are recursively pivot-sorted.
Another involved a more complicated solution involving two pivots which interchanged.
What are the benefits of either solution, why was the dual-pivot solution created? Is it faster?