Lesson plan
Radix selection
In computer science, radix selection is a non-comparative selection algorithm, the selection analog of most-significant-digit (MSD) radix sort. It enables selecting the k-th largest or smallest element of an unsorted array, or the top k elements which do not have to be in sorted order. While the simplest implementation of radix selection is as an in-place algorithm, out-of-place parallel variants have also been developed for GPUs.
Article summary
In computer science, radix selection is a non-comparative selection algorithm, the selection analog of most-significant-digit (MSD) radix sort. It enables selecting the k-th largest or smallest element of an unsorted array, or the top k elements which do not have to be in sorted order. While the simplest implementation of radix selection is as an in-place algorithm, out-of-place parallel variants have also been developed for GPUs.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.