Everything about Selection algorithm
Method for finding kth smallest value
In computer science, a selection algorithm is an algorithm for finding the th smallest value in a collection of orderable values, such as numbers. The value that it finds is called the th order statistic. Selection includes as special cases the problems of finding the minimum, median, and maximum element in the collection. Selection algorithms include quickselect, and the median of medians algorithm. When applied to a collection of values, these algorithms take linear time, as expressed using big O notation. For data that is already structured, faster algorithms may be possible; as an extreme case, selection in an already-sorted array takes time. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Selection algorithmA 5-minute orientation
- Skim a recent paper: Stability of feature selection algorithm: A reviewInfluential work since 2022
- Pick up a classic book: Priority in process algebrasThe most-reprinted book on the subject
- Read the landmark paper: Automated Algorithm Selection: Survey and PerspectivesCited 422 times
- Go sideways: Floyd–Rivest algorithmA closely related topic
- Go sideways: Median of mediansA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Automated Algorithm Selection: Survey and Perspectives
An upgraded reserve selection algorithm
An Advanced Contingency Selection Algorithm
Chaotic vortex search algorithm: metaheuristic algorithm for feature selection
Personnel selection using fuzzy MCDM algorithm
Genetic Algorithm Guided Selection: Variable Selection and Subset Selection
A combination selection algorithm on forecasting
An optimally efficient selection algorithm
🆕 Influential since 2022
Stability of feature selection algorithm: A review
Binary Artificial Algae Algorithm for feature selection
A Scalable Algorithm for Sparse Portfolio Selection
Binary arithmetic optimization algorithm for feature selection
Feature Selection with a Binary Flamingo Search Algorithm and a Genetic Algorithm
đź“š Books worth reading
- 📕Priority in process algebrasRance Cleaveland · 1999
Finite geometries, groups, and computationAkos Seress · 2006
Handbook of algorithms and data structuresG. H. Gonnet · 1984
AI-Assisted Medical DiagnosticsMilan Toma · 2025
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- 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…
- 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…
- Partial sorting In computer science, partial sorting is a relaxed variant of the sorting problem. Total sorting is the problem of returning a list of items such that its…
- Quickselect In computer science, quickselect is a selection algorithm to find the kth smallest element in an unordered list, also known as the kth order statistic…
- Quicksort Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in…
- Sorting algorithm In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order…
- Insertion sort Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time by comparisons. It is much less efficient…
- Soft heap In computer science, a soft heap is a variant on the simple heap data structure that has constant amortized time complexity for 5 types of operations.…