selection algorithm

Article summary

In computer science, a selection algorithm is an algorithm for finding the k th smallest value in a collection of orderable values, such as numbers. The value that it finds is called the 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 n values, these algorithms take linear time, O(n) 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

Key claims

1. publication date: 1973 — source: Wikipedia · confidence 0.95

Discussion questions

1. Summarise the article in your own words. Which single claim would you verify first, and why?
2. The record states that the publication date is "1973". What evidence would count against this claim?
3. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
4. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

1. Wikipedia https://en.wikipedia.org/w/index.php?oldid=1373095928