The Inversions of a List

Manuel Eberl

1 February 2019

Abstract

This entry defines the set of inversions of a list, i.e. the pairs of indices that violate sortedness. It also proves the correctness of the well-known O(n log n) divide-and-conquer algorithm to compute the number of inversions.

BSD License

Topics

Theories