Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Other Sellers on Amazon
+ Free Shipping
+ $3.99 shipping
+ $3.99 shipping
Algorithms Unlocked (MIT Press) Paperback – March 1, 2013
This month's Book With Buzz: "The Lying Game" by Ruth Ware
From the instant New York Times bestselling author of blockbuster thrillers "In a Dark, Dark Wood" and "The Woman in Cabin 10" comes Ruth Ware’s chilling new novel, "The Lying Game." See more
Frequently bought together
Customers who bought this item also bought
Algorithms are at the center of computer science. This is a unique book in its attempt to open the field of algorithms to a wider audience. It provides an easy-to-read introduction to an abstract topic, without sacrificing depth. This is an important contribution and there is nobody more qualified than Thomas Cormen to bridge the knowledge gap between algorithms experts and the general public.(Frank Dehne, Chancellor's Professor of Computer Science, Carleton University)
Thomas Cormen has written an engaging and readable survey of basic algorithms. The enterprising reader with some exposure to elementary computer programming will discover insights into the key algorithmic techniques that underlie efficient computation.(Phil Klein, Professor, Department of Computer Science, Brown University)
Thomas Cormen helps readers to achieve a broad understanding of the key algorithms underlying much of computer science. For computer science students and practitioners, it is a great review of key algorithms that every computer scientist must understand. For non-practitioners, it truly unlocks the world of algorithms at the heart of the tools we use every day.(G. Ayorkor Korsah, Computer Science Department, Ashesi University College)
About the Author
Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009).
Browse award-winning titles. See more
Top customer reviews
1. It has a section on "Algorithms on Strings". Out of many books that I perused (Algorithms in a nutshell, Skiena, Eva Tardos etc.), this book, CLRS, Algorithms by Sedgwick has a section on Strings. There are dedicated books on String algorithms but "string problems" appear practically in almost every software engineer's career that I think any general algorithms book should cover a basic portion of it. This one does.
2. Chatty but neither boring nor tedious. It uses enough words to convey the concept efficiently.
3. It contains math for sections on complexity but algorithm concepts are supported with pictures, sample algorithm runs. One just needs to follow logical arguments as it is explained.
4. All the chapters except last few pages in chapter 9, 10 are gems.
5. The length of the book is ~222. This cannot be overstated. The faster u reach towards the end of the book the better you will feel about yourself and the more you will like to finish it.
6. Pretty good paper quality and print. Love this about MIT press.
7. Price is cheap.
8. No exercises. Yes this is a good thing actually. It would have affected the flow of the book. If you need exercises then go to Big Cormen (CLRS).
1. Typos/Errors. 14 when I counted. I actually thought it cannot have any because some reviewer here said it was copyedited by someone who is a stickler for perfection so I didn't bother to check the errata page (my bad but only 14 errata’s is still impressive) until I stumbled on a possible typo (it turns out it is not) and tried to contact the author by going to the book's website. One should make sure to correct it in the book before reading.
2. Chapter 9 - section on LZW compression/decompression could have been little clearer. Chapter 10 - section on Hamiltonian cycle to Hamiltonian path reduction, subset sum reduction could have been little clearer because the explanation had more gaps in logic than usual. The author did say in the preface that he couldn't control getting into more details near the very end of the book but I felt the explanation was unclear because it is rushed than more technical details are employed.
All in all this is a solid book that treats you as an intelligent human being than a space alien or a brick.
Most recent customer reviews
Amazing and will help in,
- Data structure,
- data science