A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We give a simple and efficient algorithm for adaptively counting inversions in a sequence of n integers. Our algorithm runs in O(n + n √((Inv/n))) time in the word-RAM model of computation, where Inv is the number of inversions.arXiv:1503.01192v1 fatcat:url3d2uwyvcojcqg2lysmbna4u