We introduce the first sorting algorithm that is proven to sort n randomly drawn uniformly distributed elements in O(n) time in situ. The constants in this algorithm are small, and simulations have shown it competitive with other sorting algorithms. It is, furthermore, conceptually simple and easy to code, which makes it a practical distributive sorting algorithm.