© xkcd.com

Heap data structures and algorithms in JavaScript. Parents are js-data-structures and js-algorithms.

This README regroups projects implementing heap data structures and algorithms in JavaScript. This repository does not contain any code.

• @heap-data-structure/d-ary-heap: d-ary heap data structure for JavaScript
• @heap-data-structure/binomial-heap: Binomial heap data structure for JavaScript
• @heap-data-structure/pairing-heap: Pairing heap data structure for JavaScript
• @heap-data-structure/fibonacci-heap: Fibonacci heap data structure for JavaScript

• Leftist tree
• Skew heap
• Weak heap
• Rank-pairing heap

• Leonardo heap
• Brodal queue
• Strict Fibonacci heap
• 2-3 heap

• @comparison-sorting/heap-sort: Heap sort algorithm for Javascript

• @heap-data-structure/specification: Specification for heap data structures in JavaScript

• @data-structure/heapq: Python's heapq library for Javascript

• http://www.cs.princeton.edu/~wayne/cs423/lectures/heaps-4up.pdf
• http://stackoverflow.com/questions/6531543/efficient-implementation-of-binary-heaps
• https://en.wikipedia.org/wiki/Introduction_to_Algorithms