In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic). This includes the cases of finding the minimum, maximum, and median elements. There are, worst-case linear time, selection algorithms. Selection is a subproblem of more complex problems like the nearest neighbor problem and shortest path problems.
Read more about Selection Algorithm: Selection By Sorting, Linear Minimum/maximum Algorithms, Nonlinear General Selection Algorithm, Partition-based General Selection Algorithm, Linear General Selection Algorithm - Median of Medians Algorithm, Introselect, Selection As Incremental Sorting, Using Data Structures To Select in Sublinear Time, Selecting K Smallest or Largest Elements, Lower Bounds, Language Support, Online Selection Algorithm
Famous quotes containing the word selection:
“It is the highest and most legitimate pride of an Englishman to have the letters M.P. written after his name. No selection from the alphabet, no doctorship, no fellowship, be it of ever so learned or royal a society, no knightship,—not though it be of the Garter,—confers so fair an honour.”
—Anthony Trollope (1815–1882)