ADAPTIVE SORTING WITH AVL TREES

摘要

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 lg I + O(n). Our algorithm runs in time O(n log I) and is practically efficient and easy to implement.