Issue No. 03 - Sept. (1975 vol. 1)
Thomas Porter , Department of Computer Science, Stanford University, Stanford, Calif. 94305
The average number of levels that a new element moves up when inserted into a heap is investigated. Two probabilistic models, under which such an average might be computed are proposed. A "Lemma of Conservation of Ignorance" is formulated and used in the derivation of an exact formula for the average in one of these models. It is shown that this average is bounded by a constant and its asymptotic behavior is discussed. Numerical data for the second model are also provided and analyzed.
Binary trees, Numerical models, Computational modeling, Analytical models, Data models, Educational institutions, Probability distribution, priority queue, Analysis of algorithms, heap insertion, heap sort
T. Porter, "Random insertion into a priority queue structure," in IEEE Transactions on Software Engineering, vol. 1, no. , pp. 292-298, 1975.