Internet Explorer 11 is being discontinued by Microsoft in August 2021.
If you have difficulties viewing the site on Internet Explorer 11 we
recommend using a different browser such as Microsoft Edge, Google
Chrome, Apple Safari or Mozilla Firefox.
Last updated 09/07/24: Online ordering is currently unavailable due to technical issues. We apologise for any delays responding to customers while we resolve this. For further updates please visit our website https://www.cambridge.org/news-and-insights/technical-incident
In Algorithms Illuminated, Tim Roughgarden teaches the basics of algorithms in the most accessible way imaginable. This Omnibus Edition contains the complete text of Parts 1-4, with thorough coverage of asymptotic analysis, graph search and shortest paths, data structures, divide-and-conquer algorithms, greedy algorithms, dynamic programming, and NP-hard problems. Hundreds of worked examples, quizzes, and exercises, plus comprehensive online videos, help readers become better programmers; sharpen their analytical skills; learn to think algorithmically; acquire literacy with computer science's greatest hits; and…
Accompanied by more than 200 free YouTube videos, all recorded by the author, that cover all material in the book, and more
100 worked examples help students grasp concepts quickly
Includes nearly 200 end-of-chapter problems, all with hints or solutions and more than 100 quizzes with detailed solutions
Web site algorithmsilluminated.org contains videos, data sets for programming projects, and a discussion forum
About the book
Format: Hardback
Publication date:
15 September 2022
ISBN: 9780999282984
Availability: In stock
Author
Tim Roughgarden,Columbia University, New York
Tim Roughgarden is a Professor of Computer Science at Columbia University. His research, teaching, and expository writings have been recognized by a Presidential Early Career Award for Scientists and Engineers, the ACM Grace Murray Hopper Award, the EATCS-SIGACT Gödel Prize, a Guggenheim Fellowship, the INFORMS Lancaster Prize, and a Tau Beta Pi Teaching Award. His other books include Twenty Lectures on Algorithmic Game Theory (2016) and Beyond the Worst-Case Analysis of Algorithms (2021).