Pairing Heap Algorithm

They concluded that pairing heaps are often faster in practice than array-based binary heaps and d-ary heaps, and almost always faster in practice than other cursor-based heaps, including data structures like Fibonacci heaps that are theoretically more efficient. A pairing heap is a type of heap data structure with relatively simple implementation and excellent practical amortized performance, introduced by Michael Fredman, Robert Sedgewick, Daniel Sleator, and Robert Tarjan in 1986.

Pairing Heap source code, pseudocode and analysis

COMING SOON!