10 thoughts on “Algorithms Unlocked

  1. Jacek Ambroziak Jacek Ambroziak says:

    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 200 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 I ve been familiar with 99% of the algorithmic concepts this book discusses for years, and yet details not used daily are eventually fo 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 200 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 I ve been familiar with 99% of the algorithmic concepts this book discusses for years, and yet details not used daily are eventually forgotten Many of us are vaguely familiar with all the classic sorting algorithms, but can we code them correctly on a whiteboard in reasonable time w o off by one errors and such 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


  2. Neeraj Adhikari Neeraj Adhikari says:

    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 theor less lay reader As for me, I studied this to whet my appetite before plunging headfirst into the massive tome that is CLRS.


  3. Mkfs Mkfs says:

    I had been asked, at one point, to recommend an algorithm book to a layman.While I was wavering between O Reilly s odd Algorithms in a Nutshell and the quite good buttechnical Algorithms by Dasgupta Papadimitriou Vazirani, this book by Cormen came out 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.While I was wavering between O Reilly s odd Algorithms in a Nutshell and the quite good buttechnical Algorithms by Dasgupta Papadimitriou Vazirani, this book by Cormen came out 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 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.e., Cormen s other book , then you ll gain little from reading this.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


  4. Stefan Kanev Stefan Kanev says:

    I just love reading Thomas Cormen.If you ve never read a book on algorithms and don t have enough time to go into 1000 pages of CLRS Introduction to Algorithms , this book is for you In 10 short chapters total of 240 pages , it goes through nothan 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.If you ve never read a book on algorithms and don t have enough time to go into 1000 pages of CLRS Introduction to Algorithms , this book is for you In 10 short chapters total of 240 pages , it goes through nothan 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 and leave you wanting


  5. Siddhant Shrivastava Siddhant Shrivastava says:

    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.


  6. Sudha Hariharan Sudha Hariharan says:

    Definitely not as good and thorough as Introduction to Algorithms , but good enough for anyone looking a simpler introduction.


  7. Tugberk Ugurlu Tugberk Ugurlu says:

    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 muchfocused on the logic.As mentioned, it s entry level, touches the basics such as binary search, sorting algorithms, etc but it gets into medium to advanced category a bit in the last a few chapters where it touches NP h 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 muchfocused on the logic.As mentioned, it s entry level, touches the basics such as binary search, sorting algorithms, etc but it gets into medium to advanced category a bit in the last a few chapters where it touches NP hard problems and graph algorithms


  8. Manju Manju says:

    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 introduction to algorithms, coauthored by Cormen isappropriate that describes algorithm design techniques and certainly does not contain practice exercises at th 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 introduction to algorithms, coauthored by Cormen isappropriate that describes algorithm design techniques and certainly does not contain practice exercises at the end of the book although there are handy citations 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 Rinse Repeat


  9. Ayush Bhat Ayush Bhat says:

    Its like mini version of CLRS.Good to have after you have studied somethingthorough.


  10. Kamran Saeed Kamran Saeed says:

    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.


Leave a Reply

Your email address will not be published. Required fields are marked *