Journal article icon

Journal article

Functional Pearl: Explaining binomial heaps

Abstract:

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 tennis tournament we show that binomial heaps arise naturally through a number of logical steps. Haskell supports the deductive style of presentation very well: new types are introduced at ease, alg...

Expand abstract

Actions


Access Document


Publisher copy:
10.1017/S0956796899003317

Authors


Ralf Hinze More by this author
Journal:
JFP
Volume:
9
Issue:
1
Pages:
93-104
Publication date:
1999
DOI:
URN:
uuid:6fc288e4-3933-42d2-86c9-31b9d613f467
Local pid:
cs:1125

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP