**Purely Functional Data Structures**

by Chris Okasaki

**Publisher**: Carnegie Mellon University 1996**ISBN/ASIN**: 0521663504**Number of pages**: 162

**Description**:

This book describes data structures from the point of view of functional languages, with examples, and presents design techniques that allow programmers to develop their own functional data structures. The author includes both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for functional languages.

Download or read it online for free here:

**Download link**

(620KB, PDF)

## Similar books

**Elementary Algorithms**

by

**Larry LIU Xinyu**-

**Github**

'Elementary Algorithms' is a free book about elementary algorithms and data structures. This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures.

(

**3345**views)

**Algorithms and Data Structures**

by

**Niklaus Wirth**-

**Prentice Hall**

The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.

(

**12329**views)

**Modern Computer Arithmetic**

by

**Richard P. Brent, Paul Zimmermann**-

**LORIA**

This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.

(

**10336**views)

**The Art of Computer Programming, Volume 4**

by

**Donald E. Knuth**-

**Addison-Wesley Professional**

This work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.

(

**17916**views)