Learn functional data structures and algorithms for your applications and bring their benefits to your work now
About This Book
- Moving from object-oriented programming to functional programming? This book will help you get started with functional programming.
- Easy-to-understand explanations of practical topics will help you get started with functional data structures.
- Illustrative diagrams to explain the algorithms in detail.
- Get hands-on practice of Scala to get the most out of functional programming.
Who This Book Is For
This book is for those who have some experience in functional programming languages. The data structures in this book are primarily written in Scala, however implementing the algorithms in other functional languages should be straight forward.
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
Functional data structures have the power to improve the codebase of an application and improve efficiency. With the advent of functional programming and with powerful functional languages such as Scala, Clojure and Elixir becoming part of important enterprise applications, functional data structures have gained an important place in the developer toolkit. Immutability is a cornerstone of functional programming. Immutable and persistent data structures are thread safe by definition and hence very appealing for writing robust concurrent programs.
How do we express traditional algorithms in functional setting? Won't we end up copying too much? Do we trade performance for versioned data structures?
This book attempts to answer these questions by looking at functional implementations of traditional algorithms.
It 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.
Scala is the primary implementation languages for most of the examples. At times, we also present Clojure snippets to illustrate the underlying fundamental theme. While writing code, we use ADTs (abstract data types). Stacks, Queues, Trees and Graphs are all familiar ADTs. You will see how these ADTs are implemented in a functional setting. We look at implementation techniques like amortization and lazy evaluation to ensure efficiency.
By the end of the book, you will be able to write efficient functional data structures and algorithms for your applications.
Style and approach
Step-by-step topics will help you get started with functional programming. Learn by doing with hands-on code snippets that give you practical experience of the subject.
Table of Contents
Learning Functional Data Structures and Algorithms
- Learning Functional Data Structures and Algorithms
- About the Authors
- About the Reviewer
- Customer Feedback
- 1. Why Functional Programming?
- 2. Building Blocks
- 3. Lists
- 4. Binary Trees
- 5. More List Algorithms
- 6. Graph Algorithms
- 7. Random Access Lists
- 8. Queues
9. Streams, Laziness, and Algorithms
- Program evaluation
- Argument evaluation
- Memoization - remembering past results
- Stream in Scala
- Indexing the elements of a stream
- Creation of an infinite length stream
- Stream to list
- Some mathematical functions of the stream class
- Some more methods of the stream class
- Streams (lazy sequence) in Clojure
Some algorithms on stream
- Arithmetic progression
- Standard Brownian motion
- Fibonacci series
- 10. Being Lazy - Queues and Deques
- 11. Red-Black Trees
- 12. Binomial Heaps
- Stable and unstable sorting
- Bubble sort
- Selection sort
- Insertion sort
- Merge sort
- Quick sort
- Title: Learning Functional Data Structures and Algorithms
- Release date: February 2017
- Publisher(s): Packt Publishing
- ISBN: 9781785888731