{title}

{title} is a recursion problem about halving the search range until the target or empty range is found. It reduces the input, reaches a base case, and uses return values or side effects to build the answer.

Topic

Divide Recursion

Pattern

Divide and Shrink

Time

O(log N) or O(log exponent)

Space

O(recursion depth)

Call tree simulation

initial state

depth 0

choice

current

choice

smaller

choice

base

choice

return

Code Tracker

:::

1Result solve(input) {

2 if (baseCase(input)) return baseAnswer;

3 Result smaller = solve(reducedInput);

4 return combine(input, smaller);

Loading Lab...

Binary Search Recursion

Binary Search Recursion

{title}

{title}