How to Think about Algorithms, 2nd Edition

How to Think about Algorithms

How to Think about Algorithms

Author: Jeff Edmonds (Author)

Publisher finelybook 出版社:‏Cambridge University Press

Edition 版本:‏ ‎ 2nd edition

Publication Date 出版日期:‏ ‎ 2024-03-7

Language 语言: ‎ English

Print Length 页数: ‎ 464 pages

ISBN-10: ‎ 1009302140

ISBN-13: ‎ 9781009302142

Book Description

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.

Review

‘Jeff Edmonds’ How to Think about Algorithms offers a fresh perspective, placing methodical but intuitive design principles (pre- and post-conditions, invariants, ‘transparent’ correctness) as the bedrock on which to build and practice algorithmic thinking. The book reads like an epic guided meditation on the vast universe of algorithms, directing the reader’s attention to the core of each insight, while stimulating the mind through well-paced examples, playful but concise analogies, and thought-provoking exercises.’ Nathan Chenette, Rose-Hulman Institute of Technology

‘With a good book like this in your hands, learning about algorithms and getting programs to work well will be fun and empowering. Anybody who wants to be a good programmer will get a great deal from this surprisingly readable book. Its approach makes it perfect for reading on your own if you want to enjoy learning about algorithms without being distracted by heavy maths. It has lots of exercises that are worth doing. Most importantly, How to Think about Algorithms does just that: it shows you how to think about algorithms and become a better programmer. Knowing how to think about algorithms gives you the insights and skills to make computers do anything more reliably and faster. The book is also ideal for any taught university course, because it is self-contained and systematically sets out the essential material, but most importantly because it empowers students to think for themselves.’ Harold Thimbleby, Swansea University

Book Description

Exceptionally student-friendly, now with over 150 new exercises, key concept summaries, and a new chapter on machine learning algorithms.

相关文件下载地址

PDF | 7 MB | 2024-12-10
下载地址 Download解决验证以访问链接!
打赏
未经允许不得转载:finelybook » How to Think about Algorithms, 2nd Edition

评论 抢沙发

觉得文章有用就打赏一下

您的打赏,我们将继续给力更多优质内容

支付宝扫一扫

微信扫一扫