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

It's great book for dsa learning i would say better than learning online course easy and clear understanding

Very helpful , authentic knowledge

fine

Excellent product

I like book because of problems with their initutive solutions , concepts etc

It's quality is very good. The print may look less bright but enough for reading.

Size of letters are too small, could be little large..

Book is good but they have only given algorithm. They should have given programs.

I immediately returned this book. It is unreadable, just compare the print to another book at the same time.Maybe the kindle version has adjustable font size but don't buy the printed version.

Il libro é pieno di errori, sia grammaticali che logici. Alcuni esempi non si compilano nemmeno. Possibile che prima della pubblicazione l'autore non abbia verificato che il suo codice funzionasse?

Des pages qui ne sont pas agrafés à l'armature. Dommage.

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

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.