Skip to search formSkip to main contentSkip to account menu

Quickselect

Known as: Quick select, Select 
In computer science, quickselect is a selection algorithm to find the kth smallest element in an unordered list. It is related to the quicksort… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We revisit classical textbook sorting or selecting algorithms under a complexity model that fully takes into account the… 
2013
2013
We present multikey quickselect: an efficient, in-place, easy-to-implement algorithm for the selection problem for strings. We… 
2012
2012
Without the help of randomization, there is a naïve algorithm that requires about 2n−3 comparisons and there is a divide-and… 
2009
2009
Approximate Quickselect, a simple modification of the well known Quickselect algorithm for selection, can be used to efficien tly… 
2009
2009
Binary search trees and quicksort are examples of comparison-based data structure and algorithm respectively. Comparison-based… 
2007
2007
E-commerce gave SMEs possibility to act over the international markets. However, this introduced some new threats to business… 
2007
2007
The present invention is the process of determining whether the end when a key is input, the quick select power-off mode for the… 
2006
2006
Given a set S of n elements drawn from a linearly ordered set, and a set K = {k1, k2, . . . , kr} of positive integers between 1… 
2005
2005
The algorithms ‘quicksort’ [3] and ‘quickselect’ [2], invented by Hoare, are simple and elegant solutions to two basic problems… 
2004
2004
This paper deals with the amount of disorder that is left in a permutation after one of its elements has been selected with…