Abstract: After analyzing the basic idea of the quickselect algorithm, a non-recursive programming algorithm, cyclically iterative algorithm, for quick selection is presented. The performance of the algorithm is validated by both the traditional robust recursive algorithm and “nth_element” which is the VC++ standard library function. The result shows that the proposed cyclically iterative algorithm performs relatively better than the recursive algorithm in terms of time efficiency and reliability, while it is also more efficient compared to the “nth_element”.

Key words: quickselect, non-recursive, cyclical iteration, algorithm

摘要： 在分析快速选择算法基本思想的基础上，给出了用于快速选择的非递归实现算法——循环迭代算法，并通过实验，与递归算法以及VC++标准库函数nth_element进行了比较，结果表明，该算法比传统的递归算法具有较高的效率和可靠性；与标准库函数nth_element比较，在时间效率方面具有明显优势。

关键词: 快速选择, 非递归, 循环迭代, 算法