A stable quicksort
Dalia Motzkin · Software Practice and Experience · 1981
Abstract A sorting algorithm, called Stable Quicksort, is presented. the algorithm is comparable in speed with the Quicksort algorithm, but is stable. The experimental evidence presented support the theoretical evaluation of the performance of Stable Quicksort.