--- product_id: 71030273 title: "Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming" brand: "narasimha karumanchi" price: "€ 78.15" currency: EUR in_stock: true reviews_count: 10 url: https://www.desertcart.at/products/71030273-algorithm-design-techniques-recursion-backtracking-greedy-divide-and-conquer-dynamic store_origin: AT region: Austria --- # Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming **Brand:** narasimha karumanchi **Price:** € 78.15 **Availability:** ✅ In Stock ## Quick Answers - **What is this?** Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming by narasimha karumanchi - **How much does it cost?** € 78.15 with free shipping - **Is it available?** Yes, in stock and ready to ship - **Where can I buy it?** [www.desertcart.at](https://www.desertcart.at/products/71030273-algorithm-design-techniques-recursion-backtracking-greedy-divide-and-conquer-dynamic) ## Best For - narasimha karumanchi enthusiasts ## Why This Product - Trusted narasimha karumanchi brand quality - Free international shipping included - Worldwide delivery with tracking - 15-day hassle-free returns ## Description Full description not available ## Images ![Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming - Image 1](https://m.media-amazon.com/images/I/61An2CpXyLL.jpg) ## Customer Reviews ### ⭐⭐⭐⭐⭐ 5.0 out of 5 stars Lots of problems, in increasing level of difficulty *by J***O on Reviewed in the United States on August 5, 2018* Covers pretty much the same topics as other algorithmic / competitive programming exercises such as "Cracking the code interview", "Elements of Programming Interviews" (a masterpiece) or "Guide to Competitive Programming".What probably sets this book aside is that it covers *a lot* of different exercises in increasing level of difficulty. Having read the other three books before I found that at least the dynamic programming section of this one covers a lot of exercises that the others didn't. I still didn't look to the recursive / greedy sections but I assume those will also have plenty of exercises with long and descriptive solutions. ### ⭐⭐⭐ 3.0 out of 5 stars Inconsistent Quality of Explanations *by D***Y on Reviewed in the United States on March 10, 2019* The explanations in this book are inconsistent. In some places explanations are good (Divide and Conquer) and in some places they are lacking or missing altogether (Greedy). Sometimes explanations don't even match the algorithm given. For many problems, the algorithm is given but it is not explained why the algorithm solves the problem or why it is correct. Some explanations use variables and terms that are not defined earlier in the discussion. At times, it feels like the explanation has been copy-pasted from somewhere and is missing some context.The algorithm given for merge-sort is wrong. I was surprised to see that the author has implemented merge sort without using an auxiliary array and claimed that the space complexity is O(log n). I was doubtful the given algorithm would work so I typed it out and ran it. It throws index out of range error. Wrong implementation and complexity analysis of merge sort in an algorithms book hurts the credibility of the book.The good thing about this book is that it covers a lot of problems (more than CTCI). I like the organization of chapters based on algorithm techniques rather than data structures. Because it uses Python, the code given in the book is quite compact. I really wanted this to be my favorite interview prep book but unfortunately I can't call it so. ### ⭐⭐ 2.0 out of 5 stars Print quality issues *by S***L on Reviewed in the United States on February 13, 2019* I looked at the Amazon book preview and bought the book because I needed to practice DP, Backtracking etc for my upcoming onsite interviews.The content of the book seems good but when I received the book, the print quality for the price (This is priced higher than Cracking the Coding Interview, which is used commonly for tech interview prep) is extremely bad i.e. small and light colored font. Also code snippets with a slate gray background are fine for PDF's but very hard to read in a printed book.The screenshots highlight the difference in print quality. The one with the slate gray background for the code snippet (above "4.14 Fundamentals of graphs" section) is from this book. Notice how thin the figures on the right are even when taken from a camera. The other two pictures are from "Introduction to Algorithms" (EEE), and "Cracking the Coding Interview".I have reached out to the author using the careermonk website to check whether an electronic version is available but haven't received any response. Unfortunately, I wouldn't be able to use the book for my preparation in time and will be returning it. --- ## Why Shop on Desertcart? - 🛒 **Trusted by 1.3+ Million Shoppers** — Serving international shoppers since 2016 - 🌍 **Shop Globally** — Access 737+ million products across 21 categories - 💰 **No Hidden Fees** — All customs, duties, and taxes included in the price - 🔄 **15-Day Free Returns** — Hassle-free returns (30 days for PRO members) - 🔒 **Secure Payments** — Trusted payment options with buyer protection - ⭐ **TrustPilot Rated 4.5/5** — Based on 8,000+ happy customer reviews **Shop now:** [https://www.desertcart.at/products/71030273-algorithm-design-techniques-recursion-backtracking-greedy-divide-and-conquer-dynamic](https://www.desertcart.at/products/71030273-algorithm-design-techniques-recursion-backtracking-greedy-divide-and-conquer-dynamic) --- *Product available on Desertcart Austria* *Store origin: AT* *Last updated: 2026-05-06*