Self-adjusting binary search trees
Journal of the ACM (JACM)
Splitsort—an adaptive sorting algorithm
Information Processing Letters
A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
Journal of Algorithms
Splaysort: fast, versatile, practical
Software—Practice & Experience
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
A data structure for manipulating priority queues
Communications of the ACM
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
SIAM Journal on Computing
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
Adaptive Sorting and the Information Theoretic Lower Bound
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the adaptiveness of Quicksort
Journal of Experimental Algorithmics (JEA)
ACM Transactions on Algorithms (TALG)
Adaptive algorithms for planar convex hull problems
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Two constant-factor-optimal realizations of adaptive heapsort
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
| Hi-index | 0.00 |
We introduce Binomialsort, an adaptive sorting algorithm that is optimal with respect to the number of inversions. The number of comparisons performed by Binomialsort, on an input sequence of length n that has I inversions, is at most 2n log I/n + O(n). The bound on the number of comparisons is further reduced to 1.89n log I/n + O(n) by using a new structure, which we call trinomial queues. The fact that the algorithm is simple and relies on fairly simple structures makes it a good candidate in practice.