Research on Time Complexity of Randomized Quickselect Algorithm
LIU Xiande
YU Ruifang
LI Panchi
LIU Xiaoming
Abstract：Algorithm is the soul of the computer science,so study on the time complexity plays an important role in algorithm subject,significantly promoting the research of the algorithm design,algorithm analysis and optimization as well as actual engineer-ing.The tight upper bound of the average time complexity of randomized Quickselect algorithm is obtained by theoretical analysis, and specific experiments are used to validate it.Finally some meaningful conclusion are concluded,providing some theoretical sup-port for the relevant engineering calculation and application.
Keywords：randomized Quickselect algorithmtime complexityimproved algorithm
Publication Date：2018-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：5( 256-259,280 )