, Volume 10, Issue 1, pp 99-127

Design and implementation of an efficient priority queue

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We present a data structure, based upon a hierarchically decomposed tree, which enables us to manipulate on-line a priority queue whose priorities are selected from the interval 1,⋯,n with a worst case processing time of \(\mathcal{O}\) (log logn) per instruction. The structure can be used to obtain a mergeable heap whose time requirements are about as good. Full details are explained based upon an implementation of the structure in a PASCAL program contained in the paper.

Work supported by grant CR 62-50. Netherlands Organization for the Advancement of Pure Research (Z.W.O.).