A Survey of Adaptive Sorting Algorithms

A Survey of Adaptive Sorting Algorithms (1992)

Cached

Download Links

[ftp.cs.ust.hk]

Other Repositories/Bibliography

DBLP

by Vladimir Estivill-Castro , Derick Wood

Citations:

55 - 3 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	1 A Survey of Adaptive Sorting Algorithms	SVM HeaderParse 0.1
AUTHOR NAME	Vladimir Estivill-castro	SVM HeaderParse 0.1
AUTHOR AFFIL	LANIA	SVM HeaderParse 0.2
AUTHOR ADDR	R'ebsamen 80; Xalapa, Veracruz 91000, M'exico	SVM HeaderParse 0.1
AUTHOR NAME	Derick Wood	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; University of Western Ontario; London, Ontario N6A 5B7	SVM HeaderParse 0.2
AUTHOR ADDR	Canada	SVM HeaderParse 0.1
ABSTRACT	The design and analysis of adaptive sorting algorithms has made important contributions to both theory and practice. The main contributions from the theoretical point of view are: the description of the complexity of a sorting algorithm not only in terms of the size of a problem instance but also in terms of the disorder of the given problem instance; the establishment of new relationships among measures of disorder; the introduction of new sorting algorithms that take advantage of the existing order in the input sequence; and, the proofs that several of the new sorting algorithms achieve maximal (optimal) adaptivity with respect to several measures of disorder. The main contributions from the practical point of view are: the demonstration that several algorithms currently in use are adaptive; and, the development of new algorithms, similar to currently used algorithms, that perform competitively on random sequences and are significantly faster on nearly sorted sequences. In this survey, we present the basic notions and	SVM HeaderParse 0.1
CITATIONS	76 found	ParsCit 1.0