heap-data-structure / about Goto Github PK

create documentation repository for heap interfaces

https://en.wikipedia.org/wiki/Min-max_heap

Can also be constructed from any two heaps.

Methods: min, max, bounds => [min, max], ...

If a merge operation destroys the heaps it is applied to, then it should be called meld instead of merge. See for example the Binomial Heap implementation.

• https://en.wikipedia.org/wiki/Heap_(data_structure)

see http://stackoverflow.com/questions/6531543/efficient-implementation-of-binary-heaps

This repository does not contain any code. Deprecate npm package and remove obsolete config files.

CLRS gives a nice exposition

http://en.wikipedia.org/wiki/Heapsort#Bottom-up_heapsort

NOT in sorted order.

Commonly called heapify.

Some implementations do not need to remember the number of elements stored. But the user might want to know that. Options:

• Write source with length computation then manipulate code at runtime to remove useless operations and properties?
• Write two very similar implementations.
• Use inheritance.
• ...

see http://en.wikipedia.org/wiki/Pairing_heap

add the update, delete, decreasekey and increasekey operations

https://docs.python.org/3.4/library/heapq.html#heapq.heappushpop
https://docs.python.org/3.4/library/heapq.html#heapq.heapreplace

1. use a backreference to keep track of nodes instead of swapping childrens
   • faster because we only need to swap values and backreferences
   • additional memory used
2. implementation only supporting push pop and merge