Explain backtracking algorithm with an example.
Answers
Answered by
1
Backtracking is a general algorithm for finding all (or some solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons each partial candidate backtracks as soon as it determines that the candidate cannot possibly be
Answered by
0
Answer:
Step-by-step explanation:
Similar questions