This file implements the classical imperative binary min-heaps that
are described in the chapter 6.1 of Cormen's "Introduction to
Algorithms".
The heaps are implemented as binary trees, but concretely, the
values are stored inside an array. Moreover, the data structure
ensures that the values inside the array are always consecutive.
This implementation is imperative and acts on the heaps via
side-effects.
This file implements the classical imperative binary min-heaps that are described in the chapter 6.1 of Cormen's "Introduction to Algorithms".
The heaps are implemented as binary trees, but concretely, the values are stored inside an array. Moreover, the data structure ensures that the values inside the array are always consecutive.
This implementation is imperative and acts on the heaps via side-effects.