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.rs

fn search(arr: &[i32], target: i32, lo: i32, hi: i32) -> i32 {
	if lo > hi {
		return -1;
	}
	let mid = lo + (hi - lo) / 2;
	if arr[mid as usize] == target {
		return mid;
	}
	if arr[mid as usize] < target {
		return search(arr, target, mid + 1, hi);
	}
	search(arr, target, lo, mid - 1)
}

fn main() {
	let arr = [1, 3, 5, 7, 9, 11, 13];
	let target = 11;
	println!("{}", search(&arr, target, 0, (arr.len() as i32) - 1));
}

Complexity

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

Implementation notes

Keep the explicit control flow. Library shortcuts would hide the state changes this lesson is meant to replay.
The final output is intentionally small and deterministic for cross-language comparison.

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

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