Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming - Narasimha Karumanchi
-20% with code BOOKS
30-day return policy
Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming Algorithm Design Techniques is a detailed, friendly guide that teaches you how to apply common algorithms to the practical problems you face every day as a programmer.  What's Inside Enumeration of possible solutions for the problems. Performance trade-offs (time and space complexities) between the al ... Full description
You May Also Like
Description
Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming Algorithm Design Techniques is a detailed, friendly guide that teaches you how to apply common algorithms to the practical problems you face every day as a programmer. Â
What's InsideÂ
- Enumeration of possible solutions for the problems.Â
- Performance trade-offs (time and space complexities) between the algorithms.Â
- Covers interview questions on data structures and algorithms.Â
- All the concepts are discussed in a lucid, easy to understand manner.Â
- Interview questions collected from the actual interviews of various software companies will help the students to be successful in their campus interviews.Â
- Python-based code samples were given the book.
More Information
| Author | Narasimha Karumanchi |
|---|---|
| Publisher | Touchladybirdlucky Studios |
| Release year | 2018 |
| Cover type | Softcover |
| EAN | 9788193245255 |