Year: 2006
Type: book-chapter
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.44n lg1/n + O(n) 1. Our algorithm runs in time O(n log 1/n) and is practically efficient and easy to implement.
Author: Amr Elmasry
Institution: Alexandria University
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1492853005