Picture 1 of 2

Stock photo

Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and - Picture 1 of 2

Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and - Picture 2 of 2

Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming by Narasimha Karumanchi (Paperback, 2018)

loveourprices2 (118402)

96.1% positive Feedback

Price:

£31.86

Free postage

Estimated delivery Fri, 11 Jul

Returns:

60 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.

Condition:

New

About this product

Product Information

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.