The Role of Lazy Evaluation in Amortized Data Structures
Companion source code to
Chris Okasaki
The Role of Lazy Evaluation in Amortized Data Structures
ICFP'96, pages 62-72.
- fifo.gs: Gofer/Haskell implementation of FIFO queues requiring O(1) amortized time per operation
- binomial.gs: Gofer/Haskell implementation of binomial queues requiring O(1) amortized time per insertion
- binomial.sml: SML implementation of binomial queues requiring O(1) worst-case time per insertion