Increasing the Efficiency of Existing Sorting Algorithms by Using Randomized Wrappers

There are several available generic sorting algorithms that are highly optimized and are provided as part of standard programming libraries such as the qsort implementation of quicksort available through the C Standard library. In this work we present a practical algorithmic transformation that uses random sampling and ordered search, that can convert an existing implementation of any sorting algorithm X into a sorting algorithm Y of higher observed efficiency that still utilizes X for sorting. The resulting algorithm Y is a randomized algorithm of faster running time with high probability. Experimental results based on an implementation of the transformation support the efficiency claim. The transformation could be used as a wrapper for sorting implementations to increase their efficiency and eliminate spikes of poor performance of such implementations for certain input instances