Self-adjusting binary search trees
Journal of the ACM (JACM)
A new measure of presortedness
Information and Computation
Splitsort—an adaptive sorting algorithm
Information Processing Letters
A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
Journal of Algorithms
Sorting shuffled monotone sequences
Information and Computation
A framework for adaptive sorting
Discrete Applied Mathematics
Exploiting few inversions when sorting: sequential and parallel algorithms
Theoretical Computer Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
SIAM Journal on Computing
Fast Updating of Well-Balanced Trees
SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
Priority Queues, Pairing, and Adaptive Sorting
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Proceedings of the 4th GI-Conference on Theoretical Computer Science
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A framework for adaptive algorithm selection in STAPL
Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
On the adaptiveness of Quicksort
Journal of Experimental Algorithmics (JEA)
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We derive a variation of insertion sort that is near optimal with respect to the number of inversions present in the input. The number of comparisons performed by our algorithms, on an input sequence of length n that has I inversions, is at most n log2 (I/n + 1) + O(n). Moreover, we give an implementation of the algorithm that runs in time O(nlog2 (I/n + 1) + n). All previously known algorithms require at least cn log2(I/n + 1) comparisons for some c 1.