TY  - JOUR
TI  - Minimization of Number of Comparisons of Worst-Case Linear Selection Algorithm
T2  - 
IS  - 
KW  - binary comparisons
KW  - algorithms optimization
KW  - linear selection algorithm
KW  - recursions theory
KW  - swap generation algorithm
AB  - In this paper, a problem statement of parametric optimization of Blum, Floyd, Pratt, Rivest, and Tarjan’s worst-case linear selection algorithm is considered. We define the parameter value that guarantees minimal theoretical upper bound of worst-case number of comparisons. We research dependence between number of comparisons and various values of parameter which is based on computational experiment.
AU  - Sergey Avdoshin
AU  - M. Shatilov
UR  - https://bijournal.hse.ru/en/2010--1/26643728.html
PY  - 2010
SP  - 3-9
VL  -