
TL;DR
This paper presents an efficient adaptive algorithm for counting inversions in a sequence, with runtime depending on the number of inversions, improving efficiency for sequences with fewer inversions.
Contribution
The paper introduces a simple, adaptive algorithm that counts inversions in O(n + n√(log(Inv/n))) time, optimizing performance based on the sequence's disorder.
Findings
Runs in sublinear time for sequences with few inversions
Efficient in the word-RAM computational model
Improves upon previous inversion counting algorithms
Abstract
We give a simple and efficient algorithm for adaptively counting inversions in a sequence of integers. Our algorithm runs in time in the word-RAM model of computation, where is the number of inversions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Cellular Automata and Applications · semigroups and automata theory
