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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

We revisit the analysis of the classical QuickSelect algorithm. Usually, the analysis deals with the mean number of key…

2013

There is excitement within the algorithms community about a new partitioning method introduced by Yaroslavskiy. This algorithm…

2012

Recently, a new Quicksort variant due to Yaroslavskiy was chosen as standard sorting method for Oracle's Java 7 runtime library…

2012

Without the help of randomization, there is a naïve algorithm that requires about 2n−3 comparisons and there is a divide-and…

2010

Weighted median filters are increasingly being used in signal processing applications and thus fast implementations are of…

2009

Approximate Quickselect, a simple modification of the well known Quickselect algorithm for selection, can be used to efficien tly…

2008

This paper describes a new median algorithm and a median approximation algorithm. The former has O(n) average running time and…

2006

Quickselect with median-of-three is routinely used as the method of choice for selection of the mth element out of n in general…

2004

Quickselect with median-of-3 is largely used in practice and its behavior is fairly well understood. However, the following…

1998

Hoare’s FIND algorithm can be used to select p specified order statistics n Ž . 4 j , . . . , j from a file of n elements…