Increasing the efficiency of existing sorting algorithms by using randomized wrappers

Document Type

Article

Publication Date

1-1-2003

Abstract

There are several generic sorting algorithms available 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 but which 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 to eliminate the spikes of poor performance of such implementations for certain input instances.

Identifier

0041910994 (Scopus)

Publication Title

Computer Journal

External Full Text Location

https://doi.org/10.1093/comjnl/46.5.498

ISSN

00104620

First Page

498

Last Page

504

Issue

5

Volume

46

This document is currently not available here.

Share

COinS