a function that returns an integer for each element inserted i nthe heap this value is used to sort the heap content
the maximum number of elements that can be inserted in this heap
the manifest of T, to create arrays of T's
the manifest of T, to create arrays of T's
the manifest of T, to create arrays of T's
O(1)
O(firsts)
log(n)
the maximum number of elements that can be inserted in this heap
O(log(n))
This is a binary heap that is efficient; all operations are in O(log(n)) smallest first
the type of elements included in the heap