INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |
-- Allocate heap space.
-- Entry at top of heap.
-- May items be added?
-- Is structure filled to capacity?
-- Insert item `v' at its proper position.
-- Remove item of highest value.
-- Representation as a linear structure
-- (Sorted according to decreasing priority)
-- New priority queue containing the `n' greatest items
INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |