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 the minimum, maximum, and median elements. There are O(n) (worst-case linear time) selection algorithms, and sublinear performance is possible for structured data; in the extreme, O(1) for an array of sorted data. Selection is a subproblem of more complex problems like the nearest neighbor problem and shortest path problems. Many selection algorithms are derived by generalizing a sorting algorithm, and conversely some sorting algorithms can be derived as repeated application of selection.
Posts about Selection Algorithm
  • Top SEO News Roundup Recap Digest

    … include anything with more than 250 words (because really, who has time for that???). The Good With The Bad We admit our news selection algorithm is a bit stringent but there’s a lot of spam out there and someone has to protect the integrity of the Internet. We feel our approach ensures the highest quality and best user experience. The downside…

    WTFSEOin SEO Google- 3 readers -
Get the top posts daily into your mailbox!