Ask a Question
Doubts ?
Ask Us
Categories
what are the differences between dynamic programming & backtracking? plz reply fast.
sanchayita
on 2010-11-12 10:30:00Dynamic programming is a method of solving complex problems by breaking them down into simpler steps. It is applicable to problems that exhibit the properties of overlapping subproblems which are only slightly smaller and optimal substructure. Backtracking is a general algorithm for finding all (or some) solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate c (\"backtracks\") as soon as it determines that c cannot possibly be completed to a valid solution.
Subham
on 2010-11-14 10:30:00satisfied with dis answer :)
Sneha
on 2010-11-25 10:30:00thanx..