Master In-Demand Tech. Get Paid

Binary Search (Recursive)

Given a sorted array nums and an integer target, return the index of target using recursive binary search. If not found, return -1.

Difficulty:

JavaScript Solution

function binarySearch(nums, target, left = 0, right = nums.length - 1) {
  if (left > right) return -1;
  const mid = Math.floor((left + right) / 2);
  if (nums[mid] === target) return mid;
  if (nums[mid] > target) return binarySearch(nums, target, left, mid - 1);
  return binarySearch(nums, target, mid + 1, right);
}

Explanation: Binary search recursively divides the array until the target is found or the range becomes invalid.

⏱ O(log n) | 💾 O(log n)

Console

🎬 Share Your Coding Journey

Thumbnail Templates

Binary Search (Recursive)