Skip to main content
Conference ProceedingsOPEN ACCESS

Adaptive sorting with AVL trees

IFIP Advances in Information and Communication Technology (2004) 155 307-316
DOI: 10.1007/1-4020-8141-3_25
9Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new adaptive sorting algorithm is introduced. The new implementation relies on using the traditional AVL trees, and has the same performance limitations. More precisely, the number of comparisons performed by our algorithm, on an input sequence of length n that has I inversions, is at most 1.44nlg 1/n + o(n)1 Our algorithm runs in time O(n log 1/n) and is practically efficient and easy to implement. © 2004 Springer Science + Business Media, Inc.

Cite

CITATION STYLE

APA

Elmasry, A. (2004). Adaptive sorting with AVL trees. In IFIP Advances in Information and Communication Technology (Vol. 155, pp. 307–316). Springer New York LLC. https://doi.org/10.1007/1-4020-8141-3_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free