For anyone who has ever wondered how computers solve problems, an engagingly written guide for nonexperts to the basics of computer algorithms. Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone?
|Country:||Central African Republic|
|Published (Last):||5 January 2014|
|PDF File Size:||9.37 Mb|
|ePub File Size:||4.23 Mb|
|Price:||Free* [*Free Regsitration Required]|
Goodreads helps you keep track of books you want to read. Want to Read saving…. Want to Read Currently Reading Read. Other editions. Enlarge cover. Error rating book. Refresh and try again. Open Preview See a Problem? Details if other :. Thanks for telling us about the problem. Return to Book Page. Preview — Algorithms Unlocked by Thomas H. Algorithms Unlocked by Thomas H.
For anyone who has ever wondered how computers solve problems, an engagingly written guide for nonexperts to the basics of computer algorithms. Get A Copy. More Details Other Editions 9. Friend Reviews. To see what your friends thought of this book, please sign up. To ask other readers questions about Algorithms Unlocked , please sign up.
Lists with This Book. Community Reviews. Showing Average rating 4. Rating details. More filters. Sort order. Start your review of Algorithms Unlocked. Oct 16, Jacek Ambroziak rated it it was amazing. This book is a gem. Extremely well written, not dry, yet precise. It covers many important algorithms and intuitions behind their design and timings. At a little over pages, 10 chapters, the book can realistically be read in about 10 days in its entirety. I am reading the book as part of preparation for a technical interview.
It is wonderful in this context. Many of us are vaguely? I think the author has perfectly hit a sweet spot of importance, completeness and precision in a package that is very readable. I truly recommend this book to people who need to prepare for a software engineer interview. Jun 29, Neeraj Adhikari rated it really liked it Shelves: algorithms-and-data-structures , computer-science. This book is great as a first introduction to the formal study of algorithms.
It assumes no prior knowledge of algorithms analysis and a pretty basic knowledge of mathematics. The author succeeds in explaining some complicated concepts simply for the more or less lay reader. As for me, I studied this to whet my appetite before plunging headfirst into the massive tome that is CLRS.
Aug 06, Mkfs rated it it was amazing. I had been asked, at one point, to recommend an algorithm book to a layman. I blasted through it on the beach during vacation and found it perfect. This is a book for people interested in how computers or computer programmers solve problems. It quite naturally requires a mathematical inclination, but unlike m I had been asked, at one point, to recommend an algorithm book to a layman. It quite naturally requires a mathematical inclination, but unlike most algorithm books, it relies on description and reasoning rather than equations to illustrate the concepts.
It is difficult to determine the target audience for this book. If you've read THE book on Algorithms i. If you would like a better grasp of how programmers approach problems, perhaps as a journalist, manager, or co-worker, then this will probably be worth reading.
Any junior or self-taught programmer who finds standard algorithm texts too difficult should consider this book a must-read.
And finally, for the layman who is curious, or who wants to learn a new style of problem-solving perhaps having exhausted books by the likes of Zeitz or Michalewicz , this book will prove to be both readable and thought-provoking.
Oct 20, Stefan Kanev rated it it was amazing. I just love reading Thomas Cormen. In 10 short chapters total of pages , it goes through no more than 20 algorithms in just enough detail so you get the gist. It's not just merge-sort and bubble-sort either — it goes into string matching, compression, paths in graphs and even NP-completeness. It will give you a taste of a beautiful subject a I just love reading Thomas Cormen. It will give you a taste of a beautiful subject and leave you wanting more.
Nov 03, Siddhant Shrivastava rated it it was amazing Shelves: cs. This is the kind of book one wants to keep coming back to. It is a crisp account of the different algorithms that run the world. A very easy read. The visceral treatment makes this book an introductory text. I highly recommend this to anyone interested in knowing about algorithms.
Jul 14, Sudha Hariharan rated it liked it. Definitely not as good and thorough as "Introduction to Algorithms", but good enough for anyone looking a simpler introduction. May 02, Tugberk Ugurlu rated it it was amazing. This is one of the best books I have read on algorithms, entry level and highly digestible and the book itself is structured effectively chapter by chapter. I loved the fact that the author used pseudocode to describe the algorithm logics which made the the explanations much more focused on the logic.
May 31, Manju rated it really liked it. This book serves as a soft introduction to algorithms and how they work to solve real world problems,without any of the mathematical rigor. In that sense this book is quite useful to someone who is new to programming or simply wants to understand how computer programs or algorithms work.
This is not a textbook the other book ie. Rather than mathematical proofs, the author employs simple analogies and reasoning to explain the works of the algorithms. I think the chapters on shortest path algorithms, sorting and string algorithms are quite adequate as a way of introduction. As the author exclaims in the preface, if you get this algorithm joke you are pretty much half way there to understanding algorithm outlines: Did you hear about the computer scientist who got stuck in the shower?
He was washing his hair and following the instructions on the shampoo bottle. They read "Lather. May 15, Ayush Bhat rated it it was amazing. Its like mini version of CLRS. Good to have after you have studied something more thorough. Mar 09, Kamran Saeed rated it it was amazing. This book is great for anyone looking to get an idea of how computer algorithms are used to solve problems and how algorithms are compared with one another.
It's very approachable and clearly conveys the key insights for important algorithms and even makes spaces to describe how some problems are not solvable for computers beyond some small inputs or not solvable at all. Dec 13, Ranranzi rated it really liked it.
I like chapter 8 most. Then 3 and 4. Probably because I was exposed to these areas more often than the other. Comparing this book with the Introduction to Emacs lisp programming, I spent less time trying to figure out the problem by myself. Nov 17, Xiaoyan rated it it was amazing. A good introductory book, especially for those who are new to programming.
However, those who already had some previous exposures to algorithms might prefer the more precise and concise pseudocodes than the "wetwares" used by the author. Nov 20, Arwin rated it really liked it. More of a 3. Some parts were incredibly tough to read for someone from a non computer science background.
Took two attempts to finish reading. However, it definitely whet the appetite for a deeper dive on algorithms.
Goodreads helps you keep track of books you want to read. Want to Read saving…. Want to Read Currently Reading Read. Other editions. Enlarge cover. Error rating book. Refresh and try again.
Skip to search form Skip to main content You are currently offline. Some features of the site may not work correctly. DOI: Cormen Published Computer Science. Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms.