4 docs tagged with "recursion"

Backtracking searches a space of candidate solutions by building them one choice at a time, and

Divide and conquer breaks a problem into independent subproblems of the same kind, solves those

Dynamic Programming names the idea — overlapping subproblems plus

Time complexity answers "how does the work grow?"; space complexity asks the same question about