The Inversions of a List

Manuel Eberl 🌐

February 1, 2019

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


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


Session List_Inversions