In this article, we will demonstrate the Binary Search in JavaScript using the Recursive approach.

Binary Search is a searching technique that works on the Divide and Conquer approach. It is faster than the linear search. It only works for the sorted arrays. It takes in O(log n) time for execution.

Approach

• Create a function named recursiveBS that accepts 4 arguments i.e., array, target element, left index, and right index.
• If the left index is greater than the right it means the element does not exist hence return -1.
• Compute the mid index and check if the array at mid value is equal to the target then return the index.
• Else if the target value is less than the mid element then call the function for the left half.
• Else if the target value is greater than the mid element then call the function.
• Call the recursiveBS for the given array and target element.
• if the function returns -1 that means the element does not exist and print the output.
• else output the index returned by the recursiveBS function using the console.log method.

Example: In this example, we will see the implementation of binary search using recursion.

7 is present at index: 3