Learning Functional Data Structures and Algorithms begins with a refresher and consolidation of what functional programming is all about. Next, you’ll get to know about Lists, the work horse data type for most functional languages.
We show what structural sharing means and how it helps to make immutable data structures efficient and practical. (Limited-time offer)
Table of Contents
- Why Functional Programming?
- Building Blocks
- Lists
- Binary Trees
- More List Algorithms
- Graph Algorithms
- Random Access Lists
- Queues
- Streams, Laziness, and Algorithms
- Being Lazy – Queues and Deques
- Red-Black Trees
- Binomial Heaps
- Sorting
Download Free PDF / Read Online
Author(s): Atul S. Khot , Raju Kumar Mishra
Publisher: Packt Publishing
Published: February 2017
Format(s): Online
File size: –
Number of pages: 318
Download / View Link(s): This offer has ended.
Free as of 11/04/2023.
Publisher: Packt Publishing
Published: February 2017
Format(s): Online
File size: –
Number of pages: 318
Download / View Link(s): This offer has ended.
Free as of 11/04/2023.