Selection Problem: Difference between revisions
Jump to navigation
Jump to search
| Line 9: | Line 9: | ||
Finding the i<sup>th</sup> order statistic of a set of n ''distinct'' numbers is known as the '''selection problem'''. Finding the median is a particular case of the selection problem. The selection problem can be resolved generically by sorting the entire set and then selecting the desired element. However, key comparison sorting [[Comparison_Sorting_Algorithms_Complexity|cannot be done more efficiently than Ω(n lgn)]], and more specialized and faster algorithms exist. | Finding the i<sup>th</sup> order statistic of a set of n ''distinct'' numbers is known as the '''selection problem'''. Finding the median is a particular case of the selection problem. The selection problem can be resolved generically by sorting the entire set and then selecting the desired element. However, key comparison sorting [[Comparison_Sorting_Algorithms_Complexity|cannot be done more efficiently than Ω(n lgn)]], and more specialized and faster algorithms exist. | ||
The general selection problem can be resolved with a randomized divide-and-conquer algorithm with an expected running time of Θ(n). | |||
<font color=darkgray>TODO [[CLRS]] page 213.</font> | <font color=darkgray>TODO [[CLRS]] page 213.</font> | ||
Revision as of 01:50, 10 August 2018
Internal
Overview
The ith order statistic of a set of n numbers is the ith smallest number in the set.
Finding the ith order statistic of a set of n distinct numbers is known as the selection problem. Finding the median is a particular case of the selection problem. The selection problem can be resolved generically by sorting the entire set and then selecting the desired element. However, key comparison sorting cannot be done more efficiently than Ω(n lgn), and more specialized and faster algorithms exist.
The general selection problem can be resolved with a randomized divide-and-conquer algorithm with an expected running time of Θ(n).
TODO CLRS page 213.