C program to implement binary search using recursive function

Compare x with the middle element. If x matches with middle element, we return the mid index. Else If x is greater than the mid element, then x can only lie in right half subarray after the mid element. So we recur for right half. Else x is smaller recur for the left half. It returns location of x in. We provide nothing but the best curated videos and practice problems for our students. Check out the C Foundation Course and master the C language from basic to advanced level.

Wait no more, start learning today! Previous Suffix Array Set 1 Introduction. Data Structure Books on Flipkart. What is binary search? Linear search algorithm What is Recursion?

Binary Search using Recursion in C. BinarySearch arr , num , first , mid - 1 ;. BinarySearch arr , num , first , last ;. Share 4. In programming languages, if a program allows you to call a function inside the same function, then it is called a recursive call of the function. The C programming language supports recursion, i. But while using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.

Recursive functions are very useful to solve many mathematical problems, such as calculating the factorial of a number, generating Fibonacci series, etc. Problem : : This C program, using recursion, performs binary search. Notify of.