Algorithm Design with Haskell

Algorithm Design with Haskell
PDF
  • eBook:
    Algorithm Design with Haskell
  • Author:
    Richard Bird, Jeremy Gibbons
  • Edition:
    -
  • Categories:
  • Data:
    July 9, 2020
  • ISBN:
    1108491618
  • ISBN-13:
    9781108491617
  • Language:
    English
  • Pages:
    450 pages
  • Format:
    PDF

Book Description
This book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would be obtained with imperative languages. Carefully selected examples, both new and standard, reveal the commonalities and highlight the differences between algorithms. The algorithm developments use equational reasoning where applicable, clarifying the applicability conditions and correctness arguments. Every chapter concludes with exercises (nearly 300 in total), each with complete answers, allowing the reader to consolidate their understanding and apply the techniques to a range of problems. The book serves students (both undergraduate and postgraduate), researchers, teachers, and professionals who want to know more about what goes into a good algorithm and how such algorithms can be expressed in purely functional terms.

Content

PART ONE BASICS
1. Functional programming
2. Timing
3. Useful data structures

PART TWO DIVIDE AND CONQUER
4. Binarysearch
5. Sorting
6. Selection

PART THREE GREEDY ALGORITHMS
7. Greedy algorithms on lists
8. Greedy algorithms on trees
9. Greedy algorithms on graphs

PART FOUR THINNING ALGORITHMS
10. Introduction to thinning

11. Segments and subsequences
12. Partitions

PART FIVE DYNAMIC PROGRAMMING
13. Efficient recursions
14. Optimum bracketing

PART SIX EXHAUSTIVE SEARCH
15. Ways of searching
16. Heuristic search

Download Algorithm Design with Haskell PDF or ePUB format free


Free sample

Download in .PDF format



Add comments
Прокомментировать
Введите код с картинки:*
Кликните на изображение чтобы обновить код, если он неразборчив
Copyright © 2019