文件名称：Learning Functional Data Structures and Algorithms
文件大小：10.38MB
文件格式：EPUB
更新时间：2020-03-19 14:30:12
Functional Data Structures Algorithms
Title: Learning Functional Data Structures and Algorithms Author: Atul Khot Length: 394 pages Edition: 1 Language: English Publisher: Packt Publishing Publication Date: 2017-05-04 ISBN-10: 1785888730 ISBN-13: 9781785888731 What you will learn Learn to think in the functional paradigm Understand common data structures and the associated algorithms, as well as the context in which they are commonly used Take a look at the runtime and space complexities with the O notation See how ADTs are implemented in a functional setting Explore the basic theme of immutability and persistent data structures Find out how the internal algorithms are redesigned to exploit structural sharing, so that the persistent data structures perform well, avoiding needless copying. Get to know functional features like lazy evaluation and recursion used to implement efficient algorithms Gain Scala best practices and idioms Table of Contents Chapter 1. Why Functional Programming? Chapter 2. Building Blocks Chapter 3. Lists Chapter 4. Binary Trees Chapter 5. More List Algorithms Chapter 6. Graph Algorithms Chapter 7. Random Access Lists Chapter 8. Queues Chapter 9. Streams, Laziness, and Algorithms Chapter 10. Being Lazy - Queues and Deques Chapter 11. Red-Black Trees Chapter 12. Binomial Heaps Chapter 13. Sorting