Searching

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.R 
arr <- c(1, 3, 5, 7, 9, 11, 13)
target <- 11
search <- function(lo, hi) {
  if (lo > hi) return(-1)
  mid <- lo + (hi - lo) %/% 2
  value <- arr[mid + 1]
  if (value == target) return(mid)
  if (value < target) return(search(mid + 1, hi))
  search(lo, mid - 1)
}
cat(search(0, length(arr) - 1), "\n", sep = "")

Complexity

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

Implementation notes

  • arr <- c(1, 3, 5, 7, 9, 11, 13) creates the sorted numeric R vector.
  • target <- 11 is captured from the surrounding scope by search.
  • search <- function(lo, hi) passes only the search bounds through recursive calls.
  • The bounds and returned index are zero-based: the first call is search(0, length(arr) - 1), which is search(0, 6).
  • R vector access is still 1-based, so the probe reads value <- arr[mid + 1].
  • The base case is if (lo > hi) return(-1).
  • The midpoint uses integer division: mid <- lo + (hi - lo) %/% 2.
  • A match returns the zero-based mid.
  • If the value is too small, the code returns search(mid + 1, hi); otherwise it searches search(lo, mid - 1).

Replay steps

call search(0, 6), target = 11
mid=3, arr[4]=7: recurse right to search(4, 6)
mid=5, arr[6]=11: return 5
print 5
  • cat(search(0, length(arr) - 1), "\n", sep = "") prints the returned zero-based index 5.
execution replay The checked-in replay follows the language-neutral state table for `search-binary-recursive`.
cross-language comparison This R DSA version keeps the same data and final output as every other DSA book in this wave.