Information | |
---|---|
has gloss | eng: Pairing heaps are a type of heap data structure with relatively simple implementation and excellent practical amortized performance. However, it has proven very difficult to determine the precise asymptotic running time of pairing heaps. |
lexicalization | eng: pairing heap |
instance of | e/Heap data structure |
Lexvo © 2008-2024 Gerard de Melo. Contact Legal Information / Imprint