How to Think about Algorithms

图书简介

Understand algorithms and their design with this revised student-friendly textbook. Unlike other algorithms books, this one is approachable, the methods it explains are straightforward, and the insights it provides are numerous and valuable. Without grinding through lots of formal proof, students will benefit from step-by-step methods for developing algorithms, expert guidance on common pitfalls, and an appreciation of the bigger picture. Revised and updated, this second edition includes a new chapter on machine learning algorithms, and concise key concept summaries at the end of each part for quick reference. Also new to this edition are more than 150 new exercises: selected solutions are included to let students check their progress, while a full solutions manual is available online for instructors. No other text explains complex topics such as loop invariants as clearly, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.

Preface; Introduction; Part I. Iterative Algorithms and Loop Invariants: 1. Iterative algorithms: measures of progress and loop invariants; 2. Examples using more-of-the-input loop invariant; 3. Abstract data types; 4. Narrowing the search space: binary search; 5. Iterative sorting algorithms; 6. Euclid’s GCD algorithm; 7. The loop invariant for lower bounds; 8. Key concepts summary: loop invariants and iterative algorithms; 9. Additional exercises: Part I; 10. Partial solutions to additional exercises: Part I; Part II. Recursion: 11. Abstractions, techniques, and theory; 12. Some simple examples of recursive algorithms; 13. Recursion on trees; 14. Recursive images; 15. Parsing with context-free grammars; 16. Key concepts summary: recursion; 17. Additional exercises: Part II; 18. Partial solutions to additional exercises: Part II; Part III. Optimization Problems: 19. Definition of optimization problems; 20. Graph search algorithms; 21. Network flows and linear programming; 22. Greedy algorithms; 23. Recursive backtracking; 24. Dynamic programming algorithms; 25. Examples of dynamic programming; 26. Reductions and NP-completeness; 27. Randomized algorithms; 28. Key concepts summary: greedy algorithms and dynamic programmings; 29. Additional exercises: Part III; 30. Partial solutions to additional exercises: Part III; Part IV. Additional Topics: 31. Existential and universal quantifiers; 32. Time complexity; 33. Logarithms and exponentials; 34. Asymptotic growth; 35. Adding-made-easy approximations; 36. Recurrence relations; 37. A formal proof of correctness; 38. Additional exercises: Part IV; 39. Partial solutions to additional exercises: Part IV; Exercise Solutions; Conclusion; Index.

Trade Policy 买家须知

关于产品：
● 正版保障：本网站隶属于中国国际图书贸易集团公司，确保所有图书都是100%正版。
● 环保纸张：进口图书大多使用的都是环保轻型张，颜色偏黄，重量比较轻。
● 毛边版：即书翻页的地方，故意做成了参差不齐的样子，一般为精装版，更具收藏价值。
关于退换货：
由于预订产品的特殊性，采购订单正式发订后，买方不得无故取消全部或部分产品的订购。
由于进口图书的特殊性，发生以下情况的，请直接拒收货物，由快递返回：
● 外包装破损/发错货/少发货/图书外观破损/图书配件不全（例如：光盘等）
并请在工作日通过电话400-008-1110联系我们。
签收后，如发生以下情况，请在签收后的5个工作日内联系客服办理退换货：
● 缺页/错页/错印/脱线
关于发货时间：
一般情况下：
●【现货】下单后48小时内由北京（库房）发出快递。
●【预订】【预售】下单后国外发货，到货时间预计5-8周左右，店铺默认中通快递，如需顺丰快递邮费到付。
● 需要开具发票的客户，发货时间可能在上述基础上再延后1-2个工作日（紧急发票需求，请联系010-68433105/3213）；
● 如遇其他特殊原因，对发货时间有影响的，我们会第一时间在网站公告，敬请留意。
关于到货时间：
由于进口图书入境入库后，都是委托第三方快递发货，所以我们只能保证在规定时间内发出，但无法为您保证确切的到货时间。
● 主要城市一般2-4天
● 偏远地区一般4-7天
关于接听咨询电话的时间：
010-68433105/3213正常接听咨询电话的时间为：周一至周五上午8：30～下午5：00，周六、日及法定节假日休息，将无法接听来电，敬请谅解。
其它时间您也可以通过邮件联系我们：customer@readgo.cn,工作日会优先处理。
关于快递：
● 已付款订单：主要由中通、宅急送负责派送，订单进度查询请拨打010-68433105/3213。

How to Think about Algorithms 如何思考算法 计算机软件

How to Think about Algorithms

如何思考算法
计算机软件