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.
Citation:
Avdoshin S. M., Shatilov M. P. (2010) Minimizatsiya chisla sravneniy v khudshem sluchae v algoritme poiska poryadkovykh statistik [Minimization of Number of Comparisons of Worst-Case Linear Selection Algorithm] Biznes-informatika, 1, pp. 3-9 (in Russian)
.png){kind=small}
© 
