Binary Search (Recursive)

Use the same binary-search window as the iterative lesson, but pass lo and hi through recursive calls.

Algorithm

Basic Implementation

basic.py

arr = [1, 3, 5, 7, 9, 11, 13]
target = 11

def search(lo, hi):
    if lo > hi:
        return -1
    mid = lo + (hi - lo) // 2
    if arr[mid] == target:
        return mid
    if arr[mid] < target:
        return search(mid + 1, hi)
    return search(lo, mid - 1)

print(search(0, len(arr) - 1))

Complexity

Time: O(log n)
Space: O(log n) call stack

Implementation notes

Python keeps arr as one list of references to immutable int objects. The recursive helper passes only lo and hi; it does not slice or allocate sublists.
Each call creates a normal Python stack frame with local integer bindings for lo, hi, and mid. The base case is lo > hi, and the midpoint is computed as lo + (hi - lo) // 2 before reading arr[mid].
The search compares Python integers, recursing right with search(mid + 1, hi) for this fixture and returning 5 when arr[5] == 11. The list is not mutated, and GC is not part of the visible replay state.

execution replay The checked-in replay follows the language-neutral state table for `search-binary-recursive`.

cross-language comparison This Python DSA version keeps the same data and final output as every other DSA book in this wave.