Algorithm Design with Haskell

Haskell的算法设计

计算机科学技术基础学科

售   价:
527.00
发货周期:预计5-7周发货
作      者
出  版 社
出版时间
2020年08月31日
装      帧
精装
ISBN
9781108491617
复制
页      码
450
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 27 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个