### Abstract

This entry provides an executable functional implementation of the Median-of-Medians algorithm for selecting the k-th smallest element of an unsorted list deterministically in linear time. The size bounds for the recursive call that lead to the linear upper bound on the run-time of the algorithm are also proven.

### License

BSD License

### Topics

- Computer science/Algorithms

### Session Median_Of_Medians_Selection

- Median_Of_Medians_Selection

### Used by

- Multidimensional Binary Search Trees

## Cite

×

Median_Of_Medians_Selection-AFP

    @article{Median_Of_Medians_Selection-AFP,
      author  = {Manuel Eberl},
      title   = {The Median-of-Medians Selection Algorithm},
      journal = {Archive of Formal Proofs},
      month   = {December},
      year    = {2017},
      note    = {\url{https://isa-afp.org/entries/Median_Of_Medians_Selection.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
- Aug 16, 2018 : Isabelle2018
- Dec 22, 2017 : Isabelle2017