The fastest quicksort implementation
Since a few decades ago people know and use the best implementation of the quicksort.
We never asks if it can be made faster, because we learn this from the textbook, and it is the fastest implementation when we learned it.
Indeed, making a single pass scan from the left to the right fits the computer architect much better than swapping randomly (well, jumping between a forward pass and a backward pass is more random)
We highly recommend reading this article, because the best is always yet to come.