{"product_id":"how-to-think-about-algorithms-hardback-9781009302142","title":"How to Think about Algorithms (Hardback) 9781009302142","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eHow to Think about Algorithms\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eExceptionally student-friendly, now with over 150 new exercises, key concept summaries, and a new chapter on machine learning algorithms.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eJeff Edmonds (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781009302142, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 7 March 2024\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e464 pages\u003cbr\u003e25.1 x 17.6 x 3.2 cm, 1.32 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e'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\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eUnderstand 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.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePreface\u003cbr\u003e Introduction\u003cbr\u003e Part I. Iterative Algorithms and Loop Invariants: 1. Iterative algorithms: measures of progress and loop invariants\u003cbr\u003e 2. Examples using more-of-the-input loop invariant\u003cbr\u003e 3. Abstract data types\u003cbr\u003e 4. Narrowing the search space: binary search\u003cbr\u003e 5. Iterative sorting algorithms\u003cbr\u003e 6. Euclid's GCD algorithm\u003cbr\u003e 7. The loop invariant for lower bounds\u003cbr\u003e 8. Key concepts summary: loop invariants and iterative algorithms\u003cbr\u003e 9. Additional exercises: Part I\u003cbr\u003e 10. Partial solutions to additional exercises: Part I\u003cbr\u003e Part II. Recursion: 11. Abstractions, techniques, and theory\u003cbr\u003e 12. Some simple examples of recursive algorithms\u003cbr\u003e 13. Recursion on trees\u003cbr\u003e 14. Recursive images\u003cbr\u003e 15. Parsing with context-free grammars\u003cbr\u003e 16. Key concepts summary: recursion\u003cbr\u003e 17. Additional exercises: Part II\u003cbr\u003e 18. Partial solutions to additional exercises: Part II\u003cbr\u003e Part III. Optimization Problems: 19. Definition of optimization problems\u003cbr\u003e 20. Graph search algorithms\u003cbr\u003e 21. Network flows and linear programming\u003cbr\u003e 22. Greedy algorithms\u003cbr\u003e 23. Recursive backtracking\u003cbr\u003e 24. Dynamic programming algorithms\u003cbr\u003e 25. Examples of dynamic programming\u003cbr\u003e 26. Reductions and NP-completeness\u003cbr\u003e 27. Randomized algorithms\u003cbr\u003e 28. Key concepts summary: greedy algorithms and dynamic programmings\u003cbr\u003e 29. Additional exercises: Part III\u003cbr\u003e 30. Partial solutions to additional exercises: Part III\u003cbr\u003e Part IV. Additional Topics: 31. Existential and universal quantifiers\u003cbr\u003e 32. Time complexity\u003cbr\u003e 33. Logarithms and exponentials\u003cbr\u003e 34. Asymptotic growth\u003cbr\u003e 35. Adding-made-easy approximations\u003cbr\u003e 36. Recurrence relations\u003cbr\u003e 37. A formal proof of correctness\u003cbr\u003e 38. Additional exercises: Part IV\u003cbr\u003e 39. Partial solutions to additional exercises: Part IV\u003cbr\u003e Exercise Solutions\u003cbr\u003e Conclusion\u003cbr\u003e Index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Algorithms \u0026amp; data structures [\u003ca title=\"See our other books on Algorithms \u0026amp; data structures\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Algorithms%20\u0026amp;%20data%20structures%20%5BUMB%5D%22\"\u003eUMB\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Brand New","offer_id":52460670648600,"sku":"9781009302142","price":95.77,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9781009302142i.jpg?v=1785457692","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/how-to-think-about-algorithms-hardback-9781009302142","provider":"Freshly Printed Books","version":"1.0","type":"link"}