Which of the following best describes Backtracking?
- A. An algorithm that finds the shortest path between nodes in a graph with non-negative edge weights.
- B. An algorithmic technique that solves problems by breaking them into overlapping subproblems and storing results.
- C. A search algorithm that repeatedly divides a sorted array in half to locate a target value.
- D. An algorithmic technique that incrementally builds candidates and abandons ones that fail to satisfy constraints. ✓
Correct answer
D. An algorithmic technique that incrementally builds candidates and abandons ones that fail to satisfy constraints.
Explanation
Backtracking refers to an algorithmic technique that incrementally builds candidates and abandons ones that fail to satisfy constraints.