https://github.com/kgeorgiy/okasaki

Solutions for Okasaki's "Purely functional data structures" book
https://github.com/kgeorgiy/okasaki

Last synced: 2 months ago
JSON representation

Solutions for Okasaki's "Purely functional data structures" book

• Host: GitHub
• URL: https://github.com/kgeorgiy/okasaki
• Owner: kgeorgiy
• Created: 2013-05-15T10:43:55.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2013-09-08T20:29:31.000Z (over 11 years ago)
• Last Synced: 2024-04-09T12:00:26.842Z (9 months ago)
• Language: Haskell
• Homepage:
• Size: 227 KB
• Stars: 44
• Watchers: 4
• Forks: 4
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

• my-awesome - kgeorgiy/okasaki - 09 star:0.0k fork:0.0k Solutions for Okasaki's "Purely functional data structures" book (Haskell)

README

        
# Solutions for Okasaki's "Purely functional data structures" book

* 2 Persistence

    * 2.1 Lists

        * [Exercise 2.1](Okasaki/Chapter2/List.hs) [Idris](Okasaki/Chapter2/List.idr)

    * 2.2 Binary Search Trees

        * [Set type classes](Okasaki/Chapter2/Set.hs)

        * [Exercises 2.2-2.5](Okasaki/Chapter2/Tree.hs)

* 3 Some Familiar Data Structures in a Functional Setting

    * 3.1 Leftist Heaps

        * [Heap type class](Okasaki/Chapter3/Heap.hs)

        * [Exercise 3.2](Okasaki/Chapter3/LeftistHeap.hs)

        * [Exercise 3.3](Okasaki/Chapter3/Heap.hs)

        * [Exercise 3.4](Okasaki/Chapter3/LeftistHeapWeight.hs)

    * 3.2 Binomial Heaps

        * [Exercise 3.5](Okasaki/Chapter3/BinomialHeap.hs)

        * [Exercise 3.6](Okasaki/Chapter3/BinomialHeapOpt.hs)

        * [Exercise 3.7](Okasaki/Chapter3/ExplicitMinHeap.hs)

    * 3.3 Red-Black Trees

        * [Exercises 3.8-3.10](Okasaki/Chapter3/RBTree.hs)

* 4 Lazy Evaluation

    * 4.2 Streams

        * [Exercise 4.2](Okasaki/Chapter4/InsertionSort.hs)

* 5 Fundamentals of Amortization

    * 5.2 Queues

        * [Queue](Okasaki/Chapter5/RBTree.hs)

        * [Exercise 5.1](Okasaki/Chapter5/Deque.hs)

    * 5.4 Splay Heaps

        * [Exercise 5.4](Okasaki/Chapter5/SplayHeap.hs)

    * 5.5 Pairing Heaps

        * [Exercise 5.8](Okasaki/Chapter5/PairingHeap.hs)

* 6 Amortization and Persistence via Lazy Evaluation

    * 6.3 The Banker's Method

        * [LazyBatchedQueue](Okasaki/Chapter6/LazyBatchedQueue.hs)

    * 6.4 The Physicist's Method

        * [PhysicistsQueue](Okasaki/Chapter6/PhysicistsQueue.hs)

        * [Sortable](Okasaki/Chapter6/Sortable.hs)

    * 6.5 Lazy Pairing Heaps

        * [LazyPairingHeap](Okasaki/Chapter6/LazyPairingHeap.hs)