@article{Geffert_Kollár_2012, title={Linear-Time In-Place Selection with epsilon.n Element Moves}, volume={25}, url={https://www.cai.sk/ojs/index.php/cai/article/view/345}, abstractNote={We present a new in-place selection algorithm that finds the k-th smallest element in an array of n elements in linear time, using only epsilon.n element moves. Here epsilon&gt;0 denotes an arbitrarily small, but fixed, real constant. As a consequence, partitioning the array in-place into segments of elements with ranks smaller than, equal to, and larger than k can be performed with (1+epsilon).n element moves. Minimizing the sum of comparisons and moves, we get a selection algorithm using C(n)&lt;10.236 n comparisons and M(n)&lt;0.644 n moves. The algorithm can be further optimized by tuning up for the given cost ratio between a single move and a single comparison. As an example, we present an algorithm with C(n)+10.M(n)&lt;= 13.634n.}, number={4}, journal={COMPUTING AND INFORMATICS}, author={Geffert, Viliam and Kollár, Ján}, year={2012}, month={Jan.}, pages={333–350} }