From: Gerwin.Klein@data61.csiro.au
The Inversions of a List
by Manuel Eberl
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.
https://www.isa-afp.org/entries/List_Inversions.html
Enjoy!
Gerwin
Last updated: Nov 21 2024 at 12:39 UTC