Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles

no words is enough. simply awesome for all levels of programmers. nice examples, easy to brush up your CS fundamentals

Incredible book. I wish I read this one earlier. A great book for all levels of expertise.

If you're a computer science student at the undergrad or graduate level, or you work with computer algorithms in work (or *want* to do such work), this book might be useful to have on your shelf. I would not use this book to learn the basics of algorithms in the first place, but more as a companion book to a more traditional textbook, to get a summary of facts and a good overview of a wide range of algorithms. Comparing it to other algorithm and data structure textbooks, the material in this book is wide but shallow. There are many different algorithms and data structures examined--easily more than any other algorithm book I've come across--but you get almost a "Cliff's Notes" summary of the algorithm a lot of times. For example, in O'Reilly's "Algorithms in a Nutshell" and Sedgewick's "Algorithms", merge sort gets a deep treatment with several implementations shown in each book and a lot of words of analysis. However, in Mr. Karumanchi's book, it gets a single page with one implementation, a handful of bullet points, and a few sentences of analysis. Don't expect much in the way of mathematical proofs or theory here, but rather a straight to the point mindset. Which, if you've already studied merge sort before, and just want some basic questions answered (What is the recurrence relation? What is the space/time complexity? Why would I use this over another sorting algorithm?) could well be exactly what you need.

Some subjects should probably be revised, but visuals and subjects are good.However, code should be revised for sorting methods in my opinion.

The information is probably great, but the horrible navigation issues makes it difficult to navigate.

Book is too advanced for me at the moment but I'm sure it will come in handy later.

Very poor quality printing

This book is mostly a review text. It assumes you are already knowledgeably in C/C++ and are just reviewing for an algorithms interview. I've only read the first 3 chapters and it's pretty badly written. Many sentences are superfluous and the descriptions are often very confusing. For a book in it's 5th edition, there are a lot of typos and mistakes. The author states that "many readings have been done to correct errors", but if that is the case how did they miss the typo of spelling regressive and egressive, when defining regression (the word is critical to the definition).On page 15 the first paragraph ends with the sentence "... efficiency (how much resources (in terms of memory and time) does it take to execute the)". While this last typo can be easily interpolated by the reader, it existence typifies how sloppy the editing in this book is. This is literally just a last minute hack made to get $. If you want a good algrithims book, look to Sedgwick or Cormen. If you want a good interview prep look else where (e.g. Cracking the code interview).