Time and Space Bounds for Selection Problems

The complexity of a number of selection problems is considered. An algorithm is given to determine the mode of a multiset in a number of comparisons differing from the lower bound by only a "lower order term." The problems of finding the kth largest element in a set in minimal and near minimal space are also discussed. A time space tradeoff is demonstrated for these problems.

[1]  Frank K. Hwang,et al.  A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets , 1972, SIAM J. Comput..

[2]  J. Ian Munro,et al.  Sorting and Searching in Multisets , 1976, SIAM J. Comput..

[3]  Vaughan R. Pratt,et al.  On Lower Bounds for Computing the i-th Largest Element , 1973, SWAT.

[4]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[5]  Brian Richard Allen.  On binary search trees. , 1978 .

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

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