- Algorithms
- >
- Combinatorial algorithms
- >
- Sorting algorithms
- >
- Selection algorithms

- Applied mathematics
- >
- Algorithms
- >
- Sorting algorithms
- >
- Selection algorithms

- Applied mathematics
- >
- Theoretical computer science
- >
- Algorithms
- >
- Selection algorithms

- Combinatorics
- >
- Combinatorial algorithms
- >
- Sorting algorithms
- >
- Selection algorithms

- Comparison (mathematical)
- >
- Order theory
- >
- Sorting algorithms
- >
- Selection algorithms

- Computational mathematics
- >
- Combinatorial algorithms
- >
- Sorting algorithms
- >
- Selection algorithms

- Fields of mathematics
- >
- Applied mathematics
- >
- Algorithms
- >
- Selection algorithms

- Fields of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Selection algorithms

- Fields of mathematics
- >
- Order theory
- >
- Sorting algorithms
- >
- Selection algorithms

- Mathematical logic
- >
- Algorithms
- >
- Sorting algorithms
- >
- Selection algorithms

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- Selection algorithms

- Theoretical computer science
- >
- Algorithms
- >
- Sorting algorithms
- >
- Selection algorithms

Median of medians

In computer science, the median of medians is an approximate (median) selection algorithm, frequently used to supply a good pivot for an exact selection algorithm, mainly the quickselect, that selects

Floydâ€“Rivest algorithm

In computer science, the Floyd-Rivest algorithm is a selection algorithm developed by Robert W. Floyd and Ronald L. Rivest that has an optimal expected number of comparisons within lower-order terms.

Introselect

In computer science, introselect (short for "introspective selection") is a selection algorithm that is a hybrid of quickselect and median of medians which has fast average performance and optimal wor

Order statistic tree

In computer science, an order statistic tree is a variant of the binary search tree (or more generally, a B-tree) that supports two additional operations beyond insertion, lookup and deletion:
* Sele

BFPRT

No description available.

Quickselect

In computer science, quickselect is a selection algorithm to find the kth smallest element in an unordered list. It is also known as the kth order statistics . It is related to the quicksort sorting a

Selection algorithm

In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list or array; such a number is called the kth order statistic. This includes the cases of finding t

Â© 2023 Useful Links.