Read more
The design of algorithms for problem solving lies at the heart of computer science. Concise, yet authoritative, this book teaches the skills needed to master this essential subject. The authors challenge more traditional methods of teaching algorithms by using a functional programming context, with Haskell as the implementation language. This leads to smaller, clearer and more elegant programs which enable the programmer to understand the algorithm itself more quickly and use that understanding to explore alternative solutions. Placing the emphasis on program development rather than the mathematical properties of algorithms, the book uses a succession of practical programming examples to develop in the reader problem-solving skills which can be easily transferred to other language paradigms.
List of contents
- Introduction
- Functional Programming in Haskell
- The Efficiency of Functional Programs
- Concrete Data Types
- Abstract Data Types
- Sorting
- Graph Algorithms
- Top-down Design Techniques
- Dynamic Programming
- Advanced Topics
- Bibliography
A. Haskell Impelementations
B. Mathematical Background
Index
Summary
The design of algorithms for problem solving lies at the heart of computer science. Concise, yet authoritative, this book teaches the skills needed to master this essential subject. The authors challenge more traditional methods of teaching algorithms by using a functional programming context, with Haskell as the implementation language. This leads to smaller, clearer and more elegant programs which enable the programmer to understand the algorithm itself more quickly and use that understanding to explore alternative solutions. Placing the emphasis on program development rather than the mathematical properties of algorithms, the book uses a succession of practical programming examples to develop in the reader problem-solving skills which can be easily transferred to other language paradigms.
