%0 Journal Article %1 146381 %A Estivill-Castro, Vladmir %A Wood, Derick %C New York, NY, USA %D 1992 %I ACM %J ACM Comput. Surv. %K 2012 adaptive algorithms kde seminar survey sorting %N 4 %P 441--476 %R 10.1145/146370.146381 %T A survey of adaptive sorting algorithms %U http://portal.acm.org/citation.cfm?id=146370.146381&coll=Portal&dl=ACM&CFID=90754782&CFTOKEN=26318924 %V 24 %X 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 concepts of adaptive sorting and the state of the art of adaptive sorting algorithms.

@article{146381, 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 concepts of adaptive sorting and the state of the art of adaptive sorting algorithms.}, added-at = {2012-05-03T18:01:38.000+0200}, address = {New York, NY, USA}, author = {Estivill-Castro, Vladmir and Wood, Derick}, biburl = {https://www.bibsonomy.org/bibtex/26e90a110147baf24432332e9c9adff2c/bjoern}, description = {A survey of adaptive sorting algorithms}, doi = {10.1145/146370.146381}, interhash = {e45641db4c82751dd3d17ea2b558aeba}, intrahash = {6e90a110147baf24432332e9c9adff2c}, issn = {0360-0300}, journal = {ACM Comput. Surv.}, keywords = {2012 adaptive algorithms kde seminar survey sorting}, number = 4, pages = {441--476}, publisher = {ACM}, timestamp = {2012-06-22T08:48:53.000+0200}, title = {A survey of adaptive sorting algorithms}, url = {http://portal.acm.org/citation.cfm?id=146370.146381&coll=Portal&dl=ACM&CFID=90754782&CFTOKEN=26318924}, volume = 24, year = 1992 }