Indepth Study to the Time Complexity of Linear Time Selection Algorithm
Yunpeng Wang · Computer Programming Skills & Maintenance · 2009
The algorithm study is one of core fields in computer science.The paper makes a further study of element selection problem and the linear time selection algorithm which is used to solve the problem above.Moreover, it analyzes the timecomplexity of linear time selection algorithm respectively in the expected and worst circumstance in detail and simultaneously gives it a strict proof .At last,The paper extends the method of analogical median deeply in solving the element selectionproblem.After caculation and comparison,the smallest complexity factor with linear time has been found out.Hope it be helpful to the application in the relevant fields.