This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Random insertion into a priority queue structure
Sept. 1975 (vol. 1 no. 3)
pp. 292-298
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.
Index Terms:
Binary trees,Numerical models,Computational modeling,Analytical models,Data models,Educational institutions,Probability distribution,priority queue,Analysis of algorithms,heap insertion,heap sort
Citation:
Thomas Porter, "Random insertion into a priority queue structure," IEEE Transactions on Software Engineering, vol. 1, no. 3, pp. 292-298, Sept. 1975, doi:10.1109/TSE.1975.6312854
Usage of this product signifies your acceptance of the Terms of Use.