Optimal Time Minimal Space Selection Algorithms

Algorithms for findmg medians and solving arbitrary selection problems using a minimum number of data storage locations are investigated A linear-tmle algorithm is given in the first case, and it ~s shown that no such scheme exists for many other interesting selection problems, such as finding a quartile A right trade-off is demonstrated balancing extra space versus time.

[1]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[2]  J. Ian Munro,et al.  Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[3]  Arnold Schönhage,et al.  Finding the Median , 1976, J. Comput. Syst. Sci..

[4]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .