Functional Pearl: Explaining binomial heaps
Functional programming languages are an excellent tool for teaching algorithms and data structures. This paper explains binomial heaps, a beautiful data structure for priority queues, using the functional programming language Haskell. We largely follow a deductive approach: using the metaphor of a t...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Published: |
1999
|