We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with high probability, a very close estimate of the true median. The running time is linear in the length n of the input. The algorithm performs fewer than 4/3n comparisons and 1/3n exchanges on the average. We present analytical results of the performance of the algorithm, as well as experimental illustrations of its precision.
CITATION STYLE
Battiato, S., Cantone, D., Catalano, D., Cincotti, G., & Hofri, M. (2000). An efficient algorithm for the approximate median selection problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1767, 226–238. https://doi.org/10.1007/3-540-46521-9_19
Mendeley helps you to discover research relevant for your work.