انتخاب سریع
Also known as Hoare's selection algorithm
In computer science, quickselect is a selection algorithm to find the kth smallest element in an unordered list, also known as the kth order statistic. Like the related quicksort sorting algorithm, it was developed by Tony Hoare, and thus is also known as '''Hoare's selection algorithm'''. Like quicksort, it is efficient in practice and has good average-case performance, but has poor worst-case performance. Quickselect and its variants are the selection algorithms most often used in efficient real-world implementations.
Key facts
- Algorithm.name
- Quickselect
- Algorithm.class
- Selection algorithm
- Algorithm.image
- Animated visualization of the quickselect algorithm. Selecting the 22st smallest value.
- Algorithm.caption
- Animated visualization of the quickselect algorithm. Selecting the 22nd smallest value.
- Algorithm.data
- Array
- Algorithm.best time
- O(n)
- Algorithm.average time
- O(n)
- Algorithm.time
- O(n2)
- Algorithm.space
- O(1)
via Wikipedia infobox
Wikidata facts
- Image
- Selecting quickselect frames.gif
via Wikidata · CC0