Chris Okasaki

Chris Okasaki

Average rating: 4.14 · 542 ratings · 15 reviews · 1 distinct workSimilar authors
Purely Functional Data Stru...

4.14 avg rating — 542 ratings — published 1996 — 10 editions
Rate this book
Clear rating

* Note: these are all the books on Goodreads for this author. To add more, click here.

Upcoming Events

No scheduled events. Add an event.

“The methodological benefits of functional languages are well known [Bac78, Hug89, HJ94], but still the vast majority of programs are written in imperative languages such as C. This apparent contradiction is easily explained by the fact that functional languages have historically been slower than their more traditional cousins, but this gap is narrowing.”
Chris Okasaki, Purely Functional Data Structures

“A distinctive property of functional data structures is that they are always persistent—updating a functional data structure does not destroy the existing version, but rather creates a new version that coexists with the old one. Persistence is achieved by copying the affected nodes of a data structure and making all changes in the copy rather than in the original.”
Chris Okasaki, Purely Functional Data Structures

“The notion of amortization arises from the following observation. Given a sequence of operations, we may wish to know the running time of the entire sequence, but not care about the running time of any individual operation. For instance, given a sequence of n operations, we may wish to bound the total running time of the sequence by O(n) without insisting that every individual operation run in O(1) time. We might be satisfied if a few operations run in O(log n) or even O(n) time, provided the total cost of the sequence is only O(n). This freedom opens up a wide design space of possible solutions, and often yields new solutions that are simpler and faster than worst-case solutions with equivalent bounds.”
Chris Okasaki, Purely Functional Data Structures

Is this you? Let us know. If not, help out and invite Chris to Goodreads.