Recursion & Backtracking

{title}

{title} focuses on writing T(n) equations that describe recursive runtime. It explains how recursive calls are created, stopped, returned, and analyzed.

Topic

Recursion Mechanics

Pattern

Call Stack Reasoning

Time

Depends on recurrence

Space

O(max call depth)

Call tree simulation

initial state

depth 0

choice

enter

choice

frame

choice

base

choice

return

Code Tracker

:::

1void call(depth) {

2 if (depth == 0) return;

3 beforeRecursiveCall();

4 call(depth - 1);

5 afterRecursiveCall();

Loading Lab...

Recursion & Backtracking

{title}

{title} focuses on writing T(n) equations that describe recursive runtime. It explains how recursive calls are created, stopped, returned, and analyzed.

Topic

Recursion Mechanics

Pattern

Call Stack Reasoning

Time

Depends on recurrence

Space

O(max call depth)

Call tree simulation

initial state

depth 0

choice

enter

choice

frame

choice

base

choice

return

Code Tracker

:::

1void call(depth) {

2 if (depth == 0) return;

3 beforeRecursiveCall();

4 call(depth - 1);

5 afterRecursiveCall();

Recurrence Relation Basics

Recurrence Relation Basics

{title}

{title}