

Buy anything from 5,000+ international stores. One checkout price. No surprise fees. Join 2M+ shoppers on Desertcart.
Desertcart purchases this item on your behalf and handles shipping, customs, and support to Kyrgyzstan.
desertcart.com: Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles: 9788193245279: Karumanchi, Narasimha: Books Review: Must read - You need this book if you're serious about coding Review: simply awesome - no words is enough. simply awesome for all levels of programmers. nice examples, easy to brush up your CS fundamentals
| Best Sellers Rank | #977,791 in Books ( See Top 100 in Books ) #97 in C Programming Language #722 in Computer Programming Languages #2,912 in Job Hunting & Careers |
| Customer Reviews | 4.4 4.4 out of 5 stars (3,338) |
| Dimensions | 8.5 x 0.94 x 11 inches |
| Edition | 5th ed. |
| ISBN-10 | 819324527X |
| ISBN-13 | 978-8193245279 |
| Item Weight | 2.12 pounds |
| Language | English |
| Print length | 415 pages |
| Publication date | August 28, 2016 |
| Publisher | CareerMonk Publications |
H**Y
Must read
You need this book if you're serious about coding
P**E
simply awesome
no words is enough. simply awesome for all levels of programmers. nice examples, easy to brush up your CS fundamentals
Z**Z
A broad but shallow survey of algorithms
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.
K**A
A great book for all levels of expertise
Incredible book. I wish I read this one earlier. A great book for all levels of expertise.
K**O
Good visuals but code is spotty
Some subjects should probably be revised, but visuals and subjects are good. However, code should be revised for sorting methods in my opinion.
E**4
Covers Some Good Material - Errors Galore
There are some decent explanations and solutions throughout the book but unfortunately there are WAY too many errors sprinkled throughout the book (5th edition). I would be a little more sympathetic if this was the first edition, but you would think that after several additions, the author would clean up the mess. This is just unacceptable and will likely lead to thousands of hours of confusion for inexperienced (as well as experienced) software engineers. I'm not saying this facetiously - I would *not* hire this author for a software engineering position.
J**R
Three Stars
Book is too advanced for me at the moment but I'm sure it will come in handy later.
W**R
NOT a text book. Mostly tests!
Full of exercises and very little education. Not recommend for someone who wants to learn about this stuff. Not sure who it was written for, but definitely not for me!
F**I
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?
R**.
It deals with the required mathematics to understand these concepts in a relatively simple manner. I have been reading this book since 1 week. Here are my few cents on this book: 1. To understand this book fully, little prior programming experience is required. In particular, ability to understand recursive calls and simple data structures is enough. 2. The book begins with introduction to asymptotic analysis, their role in algorithm analysis and why you should learn them. Then it teaches you all the algorithms, beginning with the simpler ones, step by step. Each step is explained nicely, in the most elegant way. 3. Some people don't recommend this for beginners. But I, being a complete beginner in algorithms, would suggest you to go for this without any second thought. It's a huge book, heavy to carry. You will struggle with some topics, but devoting time for this will be helpful and eventually you will master algorithms. 4. This book explains all concepts in lucid manner and with simpler diagrams. 5. Explanations are accurate and to-the-point, coverage of topics is amazingly broad without being overwhelming, there are plenty of solved examples are very good. 6. This book cannot be compared with CLR. This book is mainly for interviews and reference.
S**E
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.
A**L
Des pages qui ne sont pas agrafés à l'armature. Dommage.
A**1
It just doesn’t open with the latest Kindle, a window appears saying is not compatible . And how amazon can sell just a not working book?
Trustpilot
2 days ago
1 month ago