Write a program to implement binary search using recursion in c.
Given a sorted array, write a code to search an element in an array.
For example –
Example1 : arr[] = {1, 3, 5, 6, 7} target = 5
The element 5 is found at index 2.
We have given a sorted array, we can use binary search algorithm to search an element efficiently.
Binary Search
Binary Search is a searching algorithm that search an element in a sorted array in O(logN) time complexity.
In binary search, we first calculate the mid. In next step, we compare element present at mid index to the target value. If target value is found, we return the mid index. Else If the search value is less than or greater than the middle element, the search continues in the lower or upper half of the array.
Important Points
i) A Binary search algorithm is applicable only for sorted values. An array should be sorted either in ascending or descending order.
ii) The time complexity of binary search is O(log(n)).
In my previous post, I have discussed Binary search program in c using iterative approach. In this post, I am going to explain how to implement a binary search program in c using recursion.