Given a sorted array of integers, write a function that uses binary search with recursion to find the index of a target value. If the target value is not found in the array, return -1.

Question

Accepted Answer

Binary search is an efficient algorithm for finding an item from a sorted array by repeatedly dividing the search interval in half.

Binary search works on sorted arrays only.
It has a time complexity of O(log n).
Example: Searching for 5 in [1, 2, 3, 4, 5, 6] results in finding 5 quickly.
The algorithm compares the target with the middle element and narrows down the search range.

Asked in TCS and 12 others

Given a sorted array of integers, write a function that uses binary search with recursion to find the index of a target value. If the target value is not found in the array, return -1.

Interview Questions from Popular Companies