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.

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.

License

BSD License

Topics

Session List_Inversions

Cite

× 
@article{List_Inversions-AFP,
  author  = {Manuel Eberl},
  title   = {The Inversions of a List},
  journal = {Archive of Formal Proofs},
  month   = {February},
  year    = {2019},
  note    = {\url{https://isa-afp.org/entries/List_Inversions.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: