New algorithms for selection |
| |
Authors: | Prakash V Ramanan Laurent Hyafil |
| |
Institution: | Department of Computer Science, University of Illinois at Urbana-Champaign, 1304 West Springfield Avenue, Urbana, Illinois 61801, USA;Olivetti France, 91, Rue du Faubourg, Saint-Honore 75383 Paris, Cedex 08, France |
| |
Abstract: | New algorithms are presented to select the k largest elements, and give their respective order, of a totally ordered set of n elements, when k is small compared to n. The performance of these algorithms improves over that of previously known algorithms. One of these algorithms is optimal for a wide range of values of n and k. The algorithms can be modified to select the k th largest element only. The performance of the modified algorithms improves, for asymptotic values of n, over that of previously known algorithms for selecting the k th largest element. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|