Random insertion into a priority queue structure.

  • Authors:

  • Thomas Porter;Istvan Simon

  • Affiliations:

  • -;-

  • Venue:
  • Random insertion into a priority queue structure.
  • Year:
  • 1974

Quantified Score

Hi-index 0.04

Visualization

Abstract

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 is also provided and analyzed.