Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming
I will be using this book for:

Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming

by Narasimha Karumanchi

Education Computer Science Algorithms
1 Star 2 Star 3 Star 4 Star 5 Star
0.0 out of 5 stars (0 ratings)

Algorithm Design Techniques offers a focused introduction to five foundational approaches: recursion, backtracking, greedy methods, divide and conquer, and dynamic programming. Written by Narasimha Karumanchi, it provides a structured resource for readers studying computer science, algorithms, and the principles behind systematic problem solving.

About This Book

Algorithm Design Techniques presents a focused study of fundamental approaches to developing algorithms.

The book covers recursion, backtracking, greedy techniques, divide and conquer, and dynamic programming.

These topics provide a broad foundation for understanding major strategies used in algorithm design.

Written by Narasimha Karumanchi, this title is suited to readers seeking structured coverage of core algorithmic methods.

Reviews

No reviews yet. Be the first to review this book!


Write a Review
I will be using this book for: