Binary Search using Recursion in C

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.

Binary Search Program in C

Write a code to implement binary search program in c. Given a sorted array, we have to write a code to search an element in an array using binary search.

Binary Search

A Binary Search is used to search an element in a sorted array.  In binary search, we first calculate the mid position of an array.  Then, After that we compare element to be search to the middle element an array. If a value matches with the middle element then the index is returned otherwise the algorithm repeats if the value is less than or greater than the middle element.

A Binary search algorithm is efficient than the linear search algorithm. The time complexity of binary search is O(log(n)).