### 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

- Computer science/Algorithms

### Session List_Inversions

- List_Inversions

## Cite

×

List_Inversions-AFP

    @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:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Feb 21, 2019 : Isabelle2018