1 unstable release

0.0.1 Aug 27, 2020

#47 in #union

MIT license

6KB
144 lines

Documentation

Heap

Maximal heap

Insert: O(n*log(n))

Find max: O(1)

Extract max: O(n*log(n))

Union: O(n^2*log(n))

No runtime deps