Selection and sorting with limited storage
暂无分享,去创建一个
When selecting from, or sorting, a file stored on a read-only tape and the internal storage is rather limited, several passes of the input tape may be required. We study the relation between the amount of internal storage available and the number of passes required to select the Kth highest of N inputs. We show, for example, that to find the median in two passes requires at least Ω(N1/2) and at most O(N1/2 log N) internal storage. For probabilistic methods, Θ(N1/2) internal storage is necessary and sufficient for a single pass method which finds the median with arbitrarily high probability.
[1] W. Feller,et al. An Introduction to Probability Theory and its Applications , 1958 .
[2] David P. Dobkin,et al. Time and Space Bounds for Selection Problems , 1978, ICALP.
[3] W. Feller. An Introduction to Probability Theory and Its Applications , 1959 .