Skip to main content
2 stores Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming

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

Compared at 2 stores·Used ·Updated 8 days ago
Lowest $22.50Highest $38.08
Go to the $22.50 offer

Compare buying options

Two live offers. The cheapest is used.
Compare similar items
Sold byDetailsSpecial savingsItem price
AB
AbeBooksUsed · updated 8 days ago
—
2.5% Cash Back
$22.50
Visit site
EB
eBayUsed
—
1.5% Cash Back
$38.08
Visit site

Product Description

Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic ProgrammingAlgorithm 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 InsideEnumeration 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.Py…

Set Price Drop

Get an alert as soon as it’s on sale.

Alert set

Your price
Lowest now$22.50

We’ll let you know when any store drops to your price or lower.

View price drops