## Binary Search using Recursion in Java

Write a program to implement a Binary search using recursion in java. In this tutorial, I am going to discuss binary search algorithm and it’s implementation using recursion in Java.

In my previous tutorial, i have explained how to implement binary search in java using iterative approach.

## Binary Search in PHP : Explain with Code Examples

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

Subscribe Our Tutorials

## Binary Search in Java

Write a program to implement Binary Search in Java. In this tutorial, we are going to implement a binary search algorithm in Java. Before implementing this algorithm, let’s first understand what is binary search and how it works.

## Binary Search using Recursion in C

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

We have a sorted array and we have to search an element from an array using recursive binary search program in c.

## What is binary search?

Binary Search is a searching algorithm that search an element in a sorted array in O(logN) time complexity.

In my previous tutorial, 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)).