Find element using binary search in sorted array

Reverse Array
Pair Sum Equals Number
Floor and Ceil
Largest Sum Subarray
Missing Number
Odd Occuring Number
Sort by Frequency
First and Second Smallest
Majority Element
Difference between elements
Arrange Even and Odd
Closest Sum Elements
Distinct Elements
First Repeating Number
Common Elements in Arrays
Smallest Missing Number
Max Adjacent Sum
Find Occurrences of Number
Rotate Image
Distance Between Numbers
Pair with given difference
Product Array Puzzle
Replace Elements
First Repeating Element
Move Zeroes to End
Pythagorean Triplets
Maximum Average Subarray
Subarray Sum Equal to X
Leaders in Array
Largest Pair Sum
Segregate 0s 1s and 2s
Find Duplicates
Consecutive Elements Check
Triplet with given Sum
Binary Search in Sorted Array
Fixed point in sorted array
Reorder Elements by Indexes
Merging two sorted arrays
Find next greater number
Reorder array using given indexes
Count of triplets with sum less than given value
Merge two sorted arrays
Subarray and Subsequence
Rearrange array maximum minimum form
Find the lost element from a duplicated array
Count minimum steps to get the given array
Maximum element in an array which is increasing and then decreasing
Minimum number of jumps to reach the end of an array
Subarray with given sum
Length of Longest Increasing Subsequence
Smallest positive number missing unsorted array
The Celebrity Problem
Sorted subsequence of size 3
Partition Problem
Find pair with given difference
Maximum length of chain pairs
Four elements that sum to given
Maximum circular subarray sum
Count possible triangles
Longest Increasing Subsequence
Petrol Bunks Tour
Tug of War
Counting Sort
Maximum Repeating Number
Positive Negative Arrangement
Find a Peak element
Elements More Than n/k
Max Product Subsequence
Longest Bitonic subarray in an array
Number of smaller elements on right side
Implement two stacks in an array
Maximum sum increasing subsequence
Find the two numbers with odd occurrences in an unsorted array
Largest subarray with equal number of 0's and 1's
Maximum product subarray
Replace every element with the greatest on the right side in an array
Sorting a k sorted array
Find the row with maximum number of 1's
Shuffle a given array
Iterative Implementation of quick sort
Arrange given numbers to form the biggest number
Pancake sorting
Pancake sorting Problem
Maximum Subarray Sum using Divide and Conquer
Merge Overlapping Intervals
Stock Buy Sell to Maximize Profit
Sort Elements by frequency
Print all possible combinations of r elements in a given array of size n
Monotonically increasing function
Minimum element in a sorted and rotated array
Merge k Sorted Arrays
Flip Zeroes for Consecutive 1's
Least Average Subarray
Longest span with same sum in two binary arrays
Form minimum number from given sequence of D's and I's
Number of strictly increasing subarrays
Minimum difference between any two elements in an array
Number of pairs with given sum
Make Array Palindrome
Dynamic Programming, Longest Bitonic SubSequence

Given an sorted array, Finding whether the element is present or not. If present, print the index of that element


input :

arr[] =  {1, 6, 7, 8, 9, 12, 14, 16, 26, 29, 36, 37, 156}

X = 6 //element to be searched

output :

element found at index 1


Time Complexity: O(Logn)

Given an sorted array A with N elements, Searching for an element X with Low and High variables pointing to starting and ending of an array

1. Till Low is less than or equal to high

    a. Set Mid to the Low + (High - Low)/2
    b. If the element at the Mid index is equal to the searched element, return Mid
    c. If the element at the Mid index is less than the searched element, than we need to search on right array, so update Low = Mid + 1
    d. If the element at the Mid index is greater than the searched element, than we need to search on left array, so update High = Mid - 1

This is an iterative procedure which keeps track of the search boundaries via two variables (Low and High).

C++ Program

#include <bits/stdc++.h>
using namespace std;

int Binary_search(int arr[] , int X, int low ,int high)
	while(low <= high) // till low is less than high i.e. there is atleast one integer in the considered part of array
		int mid = low + (high - low)/2; //compute the middle index
		if(arr[mid] == X) //if equal then return
			return mid;
		else if ( arr[mid] < X) //if smaller then increase the lower limit
			low = mid + 1;
		else //if larger then decrease the upper limit
		high = mid - 1;

	return -1;

int main()
	int arr[] =  { 1,6,7,8,9,12,14,16,26,29,36,37,156}; //array
	int N = sizeof(arr)/sizeof(arr[0]); //size of array
	int X;
	cin>>X; //element to be searched
	int index = Binary_search(arr,X,0,N-1); //search for the element
	if(index >= 0)
		cout << "Element found at index "<<index;
		cout<<"Element not found in the array";
	return 0;
Try It

C++ Online Test - Check Your Rank across the World

Next > < Prev
Scroll to Top