Radix selection

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

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.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1336797300 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

3 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.