Title

Repeated random insertion into a priority queue

Abstract

The average cost of inserting n elements into an initially empty heap is analyzed, under the assumption that the n! orders in which the n elements can be inserted are equally likely. It is proved that this average, expressed in number of exchanges per insertion, is bounded by a constant about 1.7645. © 1985.

Publication Title

Journal of Algorithms

Share

COinS