@ARTICLE{26583204_26643728_2010, 
	author = {Sergey Avdoshin and M. Shatilov}, 
	keywords = {, binary comparisons, algorithms optimization, linear selection algorithm, recursions theoryswap generation algorithm},
	title = {Minimization of Number of Comparisons of Worst-Case Linear Selection Algorithm},
	journal = {},
	year = {2010},
	number = {1},
	pages = {3-9},
	url = {https://bijournal.hse.ru/en/2010--1/26643728.html},
	publisher = {},
	abstract = {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.},
	annote = {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.}
}