Binary Search (Recursive)

Binary Search (Recursive)
Send Feedback

Given an integer sorted array (sorted in increasing order) and an element x, find the x in given array using binary search. Return the index of x.

Return -1 if x is not present in the given array.
Note : If given array size is even, take first mid.

Input format :

Line 1 : Array size

Line 2 : Array elements (separated by space)

Line 3 : x (element to be searched)

Sample Input :
6
2 3 4 5 6 8 
5
Sample Output:

3



// input - input array
// size - length of input array
// element - value to be searched
int binaryhelper(int input[],int s,int e,int element)
{
if(s>e)
{
return -1;
}
int mid=(s+e)/2;
if(input[mid]==element)
{
return mid;
}
else if(input[mid]<element)
{
return binaryhelper(input,mid+1,e,element);
}
else
{
return binaryhelper(input,s,mid-1,element);
}
}

int binarySearch(int input[], int size, int element) {
// Write your code here
binaryhelper(input,0,size-1,element);

}




#include <iostream>
using namespace std;

// input - input array
// size - length of input array
// element - value to be searched
int binaryhelper(int input[],int s,int e,int element)
{
if(s>e)
{
return -1;
}
int mid=(s+e)/2;
if(input[mid]==element)
{
return mid;
}
else if(input[mid]<element)
{
return binaryhelper(input,mid+1,e,element);
}
else
{
return binaryhelper(input,s,mid-1,element);
}
}

int binarySearch(int input[], int size, int element) {
// Write your code here
binaryhelper(input,0,size-1,element);

}


int main() {
int input[100000],length,element, ans;
cin >> length;
for(int i =0;i<length;i++)
{
cin >> input[i];;
}

cin>>element;
ans = binarySearch(input, length, element);
cout<< ans << endl;
}

 

Comments

Post a Comment

Popular posts from this blog

Code : All connected components

  Given an undirected graph G(V,E), find and print all the connected components of the given graph G. Note: 1. V is the number of vertices present in graph G and vertices are numbered from 0 to V-1. 2. E is the number of edges present in graph G. 3. You need to take input in main and create a function which should return all the connected components. And then print them in the main, not inside function. Print different components in new line. And each component should be printed in increasing order (separated by space). Order of different components doesn't matter. Input Format : The first line of input contains two integers, that denote the value of V and E. Each of the following E lines contains two space separated integers, that denote that there exists an edge between vertex a and b. Output Format : Print different components in new line. And each component should be printed in increasing order of vertices (separated by space). Order of different components doesn't matter....
Read more

Coding Ninjas

  Given a NxM matrix containing Uppercase English Alphabets only. Your task is to tell if there is a path in the given matrix which makes the sentence “CODINGNINJA” . There is a path from any cell to all its neighbouring cells. For a particular cell, neighbouring cells are those cells that share an edge or a corner with the cell. Input Format : The first line of input contains two space separated integers N and M, where N is number of rows and M is the number of columns in the matrix. Each of the following N lines contain M characters. Please note that characters are not space separated. Output Format : Print 1 if there is a path which makes the sentence “CODINGNINJA” else print 0. Constraints : 1 <= N <= 1000 1 <= M <= 1000 Time Limit: 1 second Sample Input 1: 2 11 CXDXNXNXNXA XOXIXGXIXJX Sample Output 1: 1 bool hasPath ( vector < vector < char >> & board , int n , int m ) { // Write your code here. } #include < iostream > #include ...
Read more