C++ Tutorial Index

C++ Tutorial C++ History C++ Installation C++ First Program C++ cin and cout C++ Data type C++ Variable C++ operator C++ Keywords

C++ Control Statements

C++ If C++ Nested if C++ If-else C++ If-else-if C++ Switch C++ Break C++ Continue C++ Goto C++ For loop C++ While loop C++ Do while loop

C++ Functions

C++ Call by Value C++ Call by Reference C++ Recursion Function C++ Inline function C++ Friend function

C++ Arrays

Single dimension array Two dimension array

C++ Strings

C++ Strings

C++ Inheritance

C++ Inheritance Single level Inheritance Multilevel Inheritance Multiple Inheritance Hierarchical Inheritance Hybrid Inheritance

C++ Polymorphism

C++ Polymorphism C++ Overloading C++ Overriding C++ Virtual Function

C++ Pointers

C++ Pointers C++ this pointer

C++ Exception Handling

C++ Exception Handling

C++ Constructors

C++ Constructors Default Constructor Parameterize Constructor Copy constructor Constructor Overloading Destructor

C++ File Handling

C++ File Handling C++ Writing to file C++ Reading file C++ Close file

Miscellaneous

C Vs C++ C++ Comments C++ Data Abstraction C++ Identifier C++ Memory Management C++ Storage Classes C++ Void Pointer C++ Array To Function C++ Expressions C++ Features C++ Interfaces C++ Encapsulation std::min in C++ External merge sort in C++ Remove duplicates from sorted array in C++ Precision of floating point numbers Using these functions floor(), ceil(), trunc(), round() and setprecision() in C++ C++ References C++ Friend Functions C++ Mutable keyword Unary Operators in C++ Initialize Array of objects with parameterized constructors in C++ Differences between #define & const in C/C++ C++ Program to Implement Shell Sort C++ Program to Implement Merge Sort Storage Classes in C Vector resize() in C++ Passing by Reference Vs. Passing by the pointer in C++ Free vs delete() in C++ goto statement in C and C++ C++ program to read string using cin.getline() C++ String Concatenation Heap Sort in C++ Swap numbers in C++ Input Iterators in C++ Fibonacci Series in C++ C ++ Program: Alphabet Triangle and Number Triangle C++ Program: Matrix Multiplication C++ Program to Print Fibonacci Triangle Stack in C++ Maps in C++ Queue in C++ C++ Bitset C++ Algorithms Priority Queue in C++ C++ Multimap C++ Deque Function Pointer in C++ Sizeof() Operators in C++ C++ array of Pointers free() Vs delete in C Timsort Implementation Using C++ CPP Templates C++ Aggregation C++ Enumeration C++ Math Functions C++ Object Class C++ Queue Initialize Vector in C++ Vector in C++ C++ STL Components Function overloading in C++ C++ Maximum Index Problem C++ find missing in the second array C++ Program to find the product array puzzle C++ Program To Find Largest Subarray With 0 Sum C++ Program To Move All Zeros To The End Of The Array C++ Program to find the element that occurs once C++ Program to find the largest number formed from an array Constructor Vs Destructor C++ Namespaces C++ OOPs Concept C++ Static C++ Structs C++ Try-Catch C++ User Defined Exceptions C++ Virtual Destructor C++ vs C# Malloc() and new in C++ Palindrome Number Program in C++ Snake Code in C++ Splitting a string in C++ Structure Vs Class in C++ Virtual Function Vs Pure Virtual Function C++ Bidirectional Iterators C++ Forward Iterators C++ Iterators C++ Output Iterators C++ Range-based For Loop Converting string into integer in C++ LCM Program in C++ Type conversion in C++ Add two numbers using the function in C++ Advantage and disadvantage friend function C++ Armstrong Number Program in C++ ATM machine program in C++ using functions Binary to Decimal in C++ Bit Manipulation in C++ C++ Constructor C++ Dijkstra Algorithm Using the Priority Queue C++ int into String C++ Signal Handling Decimal to Binary in C++ Decimal to Hexadecimal in C++ Decimal to Octal in C++ Factorial Program in C++ Function in C++ Hexadecimal to Decimal in C++ Octal to Decimal in C++ Reverse a Number in C++ Structure Vs Class in C++ C++ Forward Iterators C++ Output Iterators C++ Prime number program Char Array to String in C++ Constructor Overloading in C++ Default arguments in C++ Different Ways to Compare Strings in C++ Dynamic Binding in C++ Program to convert infix to postfix expression in C++ SET Data Structure in C++ Upcasting and Downcasting in C++ Reverse an Array in C++ Fast Input and Output in C++ Delete Operator in C++ Copy elision in C++ C++ Date and Time C++ Bitwise XOR Operator Array of sets in C++ Binary Operator Overloading in C++ Binary Search in C++ Implementing the sets without C++ STL containers Scope Resolution Operator in C++ Smart pointers in C++ Types of polymorphism in C++ Exception Handling in C++ vs Java Const Keyword in C++ Type Casting in C++ Static keyword in C++ vs Java Inheritance in C++ vs Java How to concatenate two strings in C++ Programs to Print Pyramid Patterns in C++ swap() function in C++ Structure of C++ Program Stringstream in C++ and its applications rand() and srand() in C / C++ C++ Ternary Operator C++ Scope of Variables While Loop Examples in C++ Star pattern in C++ using For Loops For Loop Examples in C++ Do-While Loop Examples in C++ Top 5 IDEs for C++ That You Should Try Once Assertions in C/C++ C++ Convert Int to String Continue in C++ While loop Diamond Pattern in C++ using For Loop How to Reverse a String in C++ using Do-While Loop How to Reverse a String in C++ using For Loop How to Reverse a String in C++ using While Loop Infinite loop in C++ Loops in C++ Returning Multiple Values from a Function using Tuple and Pair in C++ wcscpy(), wcslen(), wcscmp() Functions in C++ Auto keyword in C++ C++ 11 vs C++ 14 vs C++ 17 C++ STL (Standard Template Library) Differences Between C Structures and C++ Structures Divide by Zero Exception in C++ Dynamic Constructor in C++ Dynamic Memory Allocation in C++ Find the Size of Array in C/C++ without using sizeof() function Floating Point Operations and Associativity in C, C++ and Java Hello World Program in C++ How to create a table in C++ How to Setup Environment for C++ Programming on Mac Implementation of a Falling Matrix in C++ Message Passing in C++ Pointer to Object in C++ Templates in C++ vs Generics in Java Ways to Copy a Vector in C++ What does Buffer Flush mean in C++ sort() function in C++ Structure Sorting (By Multiple Rules) in C++ Similarities between C++ and Java std::distance in C++ Array program in C++ C++ Tricks for Competitive Programming Desired Capabilities in Selenium Web Driver in C++ Socket Programming in C++ Template Specialization in C++ Classes and Objects in C++ Convex hull Algorithm in C++ DES in C++ C++ vardiac() function Difference between Two Sets in C++ Difference between Exit and Return Structured Binding in C++ Differences between Local and Global Variable Bitwise Operator vs Logical Operator Difference between OOP and POP in C++ Fork in C++ Functors in C++ How to call a void function in C++ How to create a directory or folder in C/C++ How to create a library in C++ How to create a stack in C++ How to create the Processes with Fork in C++ How to Handle Divide by Zero Exception in C++ Lambda Expression in C++ Pattern programs in C++ Roadmap to C++ Programming Substring in C++ Virtual base class in C++ Bits stdc++.h in C++ Top 14 Best Free C++ IDE (Editor & Compiler) for Windows in 2022 Bitmasking in C++ Auto Keyword in C++ Features of OOPS in C++ Hospital Management Project in C++ How to Declare Unordered Sets in C++ How to Sort an Array in C++ Include Guards in C++ Iostream in C++ Method overriding in C++ How to run program in turbo c++ How to Use Getline in C++ Leap Year Program in C++ Naming Convention in C++ New Operator in C++ Nullptr in C++ Object Slicing in C++ Principles of Object-Oriented Programming in C++ Processing strings using std string stream in C++ Pure Virtual Function in C++ With Example Program Random Number Generator in C++ Singleton Design Pattern in C++ Size_t Data Type in C++ Skyline Problem in C++ System() function in C++ Web Development in C++ Data Hiding in C++ Difference between exit() and _Exit() in C++ Hashing in C++ Object in C++ Sum of all Elements between k1’th and k2’th Smallest Elements Virtual class in C++ Vector Size in C++ Top best IDEs for C/C++ Developers in 2022 Tensorflow in C++ Sliding Window Technique in C++ Reverse String Word-Wise in C++ Returning a Function Pointer from a Function in C/C++ RTTI in C++ Pthreads or POSIX Threads in C++ Reserved Keywords in C++ Passing a Vector to a function in C++ 10 Best C and C++ Books for Beginners & Advanced Programmers Add two numbers represented by two arrays in C++ Array of Object in C++ C++ Program For FCFS Containership in C++ Counting Frequencies of Array Elements in C++ Decltype type Specifier in C++ Dynamic _Cast in C++ Difference between int main() and int main(void) in C/C++ Depth First Search Program to Traverse a Graph in C++ Features and Use Of Pointers in C/C++ Fread Function in C++ Programming Fscanf Function in The C++ Functions in C++ With Types and Examples Gmtime Function in C/C++ How is Multiset Implemented in C++ How to Build a Program in C++ How to Declare a 2d Array Dynamically in C++ inheritance Program in C++ int Max and int Min in C/C++ is It Fine to Write Void Main Or Main in C/C++ How to create a button in C++ abs() function in C++ Compile Time Polymorphism in C++ Division in C++ Factorial of a Number in C++ using while Loop Multiset in C++ 4 Pillars of OOPs Approach in C++ Backtracking Time Complexity in C++ C++ Global Variable C++ Pipe Tutorial Observer Design Pattern in C++ Private Inheritance in C++ Pthread in C++ Parameters SDL library in C++ with Examples Pointers in C++ Abstract Factory Design Pattern in C++ Ascending order in C++ How the value is passed in C++ Call by Pointer in C++ Constexpr in C++ Deadlock in C++ Design Patterns in C++ Factory Method for Designing Pattern in C++ How to calculate size of string in C++ Name Mangling and extern in C++ Preventing Object Copy in C++ Program that produces different results in C and C++ Quick Sort in C++ Single Handling in C++ Type difference of Character literals in C VS C++ Use of Inheritance in C++ User-defined literals in C++ Vector methods in C++ Void * in C and C++ Zombie and Orphan Process in C++ Isprint() in C++ List and Vector in C++ List iterators in C++ Merging Two Vectors in C++ Sleep function in C++ Stoi function in C++ String erase() in C++ String Trim in C++ When should we write own Assignment operator in C++ C++ tcp client server example C++ tcp server example Early Binding and Late Binding in C++ Factory Design Pattern in C++ Fisher-Yates shuffle algorithm in C++ For Auto in C++ Group anagrams in C++ How to convert binary string to int in C++ How to convert string to float in C++ How to remove space from string in C++ How to use pair in C++ How to use the string find() in C++ Dynamic Casting in C++ 2D Vector Initialization in C++ C++ GUI Visual Studio C++ IPC C++ Macro Function Example C++ Permutation Overloading Stream Insertion in C++ Overloading array Index operator in C++ Operators that cannot be overloaded in C++ Operator overloading in C++ isprint() function in c++ Is_trivial function in C++ Is assignment operator Inherited in C++ div() function in C++ Default Assignment Operator and References in C++ Copy Constructor vs Assignment Operator in C++ Conversion Operator in C++ Array sum in C++ STL C++ Define Macro C++ Design C++ Factory Pattern TCP Client Server Example in C++ Convert String to Uppercase in C++ exit() and _Exit() in C and C++ Initializer list in C++ Iterator invalidation in C++ Lower bound in C++ Modulus of Two float numbers or double number Pass by value in C++ Set insert function in C++ Std partition_point in C++ Unary Operator Overloading in C++ Using Default Arguments with Virtual Functions Virtual Functions and Runtime Polymorphism What is endl in C++ What is Unary Operator Overloading in C++ Which operators cannot be overloaded in C++ C++ Program to Divide the String Into N equal Parts Gray Code to Binary Code in C++ How to get the value of pi in C++ Multimap value_comp() function in C++ Vector of Vectors in C++ Naïve Bayes Algorithm in C++ Minimum Cost Path Problem in C++ 10 C++ Programming Tricks You Should Know btowc() function in C++ forward_list::cend() in C++ Unordered_multimap max_load_factor() function in C++ Cpp_int in c++ Dynamic Objects in C++ FLOCK() FUNCTION IN C++ Generate Random Double Numbers in C++ How to Assign Infinity to a Number in C++ Jump statements in C++ Multipath inheritance in C++ Out of Range Exception in C++ Size of Class in C++ Size of string in C++ std::binary_negate in c++ Thread_local in C++ Tokenizing a String in C++ Ancestors of a Node in Binary Search Tree C++ program for Double to String Conversion C++ Program to Demonstrate Use of Formatting Flags on Float Output Clamp in C++ K-Dimensional Tree in C++ Mutable Lambda in C++ Power Set in C++ Program to Find Sum of Geometric Progression Std::Back_inserter in C++ Strpbrk() function in C++ Size of int in C++ TYPES OF MANIPULATORS IN C++ Double colon in C++ How to sort vector in C++ How to use Setprecision in C++ How to write a Vector in C++ Insertion in Splay Tree in C++ Merge Sort Algorithm in C++ Printing a Character using ASCII value in C++ Regex in C++ Size of Data Types in C++ Sqrtf() function in C++ Static Casting in C++ Using Range in Switch Case in C++ wcstoimax() and wcstoumax() function in C++ What is float in C++ What is the Diamond Problem in C++ Best way to learn C++ ios setstate() function in C++ Nested Namespace in C++ Single Inheritance in C++ std::fixed, std::scientific, std::hexfloat, std::defaultfloat in C++ StringStream in C++ for Decimal to Hexadecimal and back The OFFSETOF() macro in C++ Difference between std::next and std::advance in C++ Hiding of all overloaded methods with same name in base class in C++ C++ program to concatenate two strings using operator overloading Difference between array::fill() and array::swap() in C++ Difference between Friend Function and Virtual Function in C++ Semaphores in C++ Seekg in C++ UDP server- client implementattion in C++ What is long long in C++ CSV file management using C++ Toggle bits of a number except first and last bits in C++ Trailing Return Type C++ 11 Binary search implementation in C++ Different Versions of C++ What is Cascading in C++ Background Colour in C++ BOOL DATATYPE IN C++ BIT VECTORS IN C++ Literals in C++ Application of pointer in C++ Index with minimum sum of prefix and suffix sums in an array in C++ Maximum sum Bi-tonic sub-sequence in C++ std::optional in C++ C/C++ program for triangular matchstick number COUT COMMAND IN C++ LANGUAGE Adjacency matrix program in C++ language Difference between Null String and Empty String in C++ Character data type in c++ Constructors in Inheritance C++ Comma Operator Overloading in C++ Structure and Class in C++ Template Definition in C++ Tree Data Structure in C++ Typename in C++ C++ program to implement the bin packing algorithm How to merge multiple std::sets into a single std::set in C++? Stack Clear C++ C++ Friend Class Seekg in C++ Semaphores in C++ C++ Exceptions Difference Between C and C++ Double-linked list program in C++ Color Code in C++ CRC Program in C++ Anti-Clockwise spiral traversal of a binary tree in C++ Advantages of OOP in C++ Cryptarithmetic Puzzle in C++ Angular sweep algorithm in C++

Binary Search in C++

The binary search in the C++ programming language will be discussed. By continually halves the array and then seeking specified items from a half array; binary search is a technique for finding supplied elements from a sorted array. And so on until the perfect match is found. Only sorted data structures are supported. The binary search algorithm has an O time complexity (log n).

Algorithm

The algorithm for performing a binary search in C++ is as follows:

  • As a search key, start with the middle member of the whole array.
  • Return an index of the search key if the value of the search key is equal to the item.
  • Alternatively, if the search key's value is smaller than the item in the interval's middle, limit the interval to the bottom half.
  • Otherwise, limit it to the upper half of the page.
  • Check the value from the second point until the interval is empty or the value is discovered.
beg = 0 ;  
end = size - 1 ;  
while ( beg < = end )  
{  
// calculate mid value  
mid = ( beg + end ) / 2 ;  
/* if the specified element is found at mid index, terminate the process and return the index. */  
// Check middle element is equal to the defined element.  
If ( arr [ mid ] = = num )  
{  
return mid + 1 ;  
}  
else if ( arr [ mid ] > num )  
{  
    end = mid - 1 ;  
}  
else if ( arr [ mid ] < num )  
{  
    Beg = mid + 1 ;  
}  
}  
// If the element does not exist in the array, return -1.  
Return -1 ;

In C++ follow these steps to execute a binary search:

Step 1: Declare the variables and sort all of the items in an array (ascending or descending).

Step 2: Split the array element listings into halves.

Step 3: Now compare the target items to the array's centre member. Return the location of the middle element and finish the search if the target element's value matches that of the middle element.

Step 4: If the target element is less than the middle element, we look for it in the array's lower half.

Step 5: If the target element is larger than the centre element, we must look for it in the array's greater half.

Example 1: Using the binary search, locate the provided integer from a sorted array:

Let's use the C++ programming language to create a program that uses the binary search to discover a certain integer from a sorted array.

#include < iostream >  
#include < bits/stdc++.h >
#include < stdio >
#include < stdlib >
#include < conio.h >  
using namespace std ;  
int main ( )  
{  
    // declaration of the variables and array  
    int arr [ 100 ] , st , mid , end , i , num , tgt ;  
    cout << " Define the size of the array: " << endl ;  
    cin >> num ; // get size        
    // enter only sorted array  
        cout << " enter the values in sorted array either ascending or descending order: " << endl ;  
    // use for loop to iterate values  
    for ( i = 0 ; i < num ; i++ )  
    {  
        cout << " arr [ " << i << " ] = " ;  
        cin >> arr [ i ] ;   
    }  
    // initialize the starting and ending variable's values  
    st = 0 ;  
    end = num - 1 ; // size of array ( num ) - 1  
    // define the item or value to be search  
    cout << " Define a value to be searched from sorted array: " << endl ;  
    cin >> tgt ;  
    // use while loop to check 'st', should be less than equal to 'end'.  
    while ( st < = end )  
    {  
        // get middle value by splitting into half  
        mid = ( st + end ) / 2 ;  
        /* if we get the target value at mid index, print the position and exit from the program. */  
        if ( arr [ mid ] == tgt )  
        {  
            cout << " element is found at index " << ( mid + 1 ) ;  
            exit ( 0 ) ;  // use for exit program the program  
        }  
        // check the value of target element is greater than the mid element' value  
        else if ( tgt > arr [ mid ] )  
        {  
            st = mid + 1 ; // set the new value for st variable  
        }  
        // check the value of target element is less than the mid element' value  
        else if ( tgt < arr [ mid ] )  
        {  
            end = mid - 1 ; // set the new value for end variable  
        }  
    }  
    cout << " Number is not found. " << endl ;  
    return 0 ;  
}   

OUTPUT:

Define the size of the array: 
10
enter the values in sorted array either ascending or descending order:
Arr [ 0 ]  = 12
Arr [ 1 ]  = 24
Arr [ 2 ]  = 36
Arr [ 3 ]  = 48
Arr [ 4 ]  = 50
Arr [ 5 ]  = 54
Arr [ 6 ]  = 58
Arr [ 7 ]  = 60
Arr [ 8 ]  = 72
Arr [ 9 ]  = 84
Define a value to be searched from sorted array:
50
element is found at index 5
……………………………………………………………………..
Process executed in 2.22 seconds
Press any key to continue.

Explanation:

In the above example of a program in C++, search for a element in a sorted array. First we find the middle element and then comparing our element or key with the middle element if the key is les then middle element then we bring the end pointer from last element to mid+1 and performing the procedure again till we find the element or the key.

Example 4: Another type of iterative function program for binary search in C++:

#include < bits/stdc++.h >
#include < stdio >
#include < stdlib >
#include < vector >
#include < iostream >
using namespace std ; 
int binarySearch ( vector < int > v , int To_Find )
{
	int lo = 0 , hi = v.size ( ) - 1 ;
	int mid ;
	// This below check covers all cases , so need to check
	// for mid = lo - ( hi - lo ) / 2
	while ( hi - lo > 1 ) {
		int mid = ( hi + lo ) / 2 ;
		if ( v [ mid ] < To_Find ) {
			lo = mid + 1 ;
		}
		else {
			hi = mid ;
		}
	}
	if ( v [ lo ] == To_Find ) {
		cout << "Found"
			<< " At Index " << lo << endl ;
	}
	else if ( v [ hi ] == To_Find ) {
		cout << "Found"
			<< " At Index " << hi << endl ;
	}
	else {
		cout << "Not Found" << endl ;
	}
}
int main ( )
{
	vector < int > v = { 1 , 3 , 4 , 5 , 6 } ;
	int To_Find = 1 ;
	binarySearch ( v , To_Find ) ;
	To_Find = 6 ;
	binarySearch ( v , To_Find ) ;
	To_Find = 10 ;
	binarySearch ( v , To_Find ) ;
	return 0 ;
}

OUTPUT:

Found At Index 0
Found At Index 4
Not Found
……………………….
Process executed in 2.22 seconds
Press any key to continue. 

Explanation

In the above example of a program in C++, we have used vector instead of array and using to_find function but using while loop and using mid pointer as we have discussed which is created by initializing lo pointer at index 0 and hi at index n-1, where n is the length of the vector. If the element which we want to find is the element which is present at the middle element, then middle element is our element or the key.

Example 3: A program that uses a user-defined function to execute a binary search.

/* program to find the specified element from the sorted array using the binary search in C++. */  
#include < iostream >  
using namespace std ;  
/* create user-defined function and pass different parameters: 
arr [ ] - it represents the sorted array; 
num variable represents the size of an array; 
tgt variable represents the target or specified variable to be searched in the sorted array. */  
int bin_search ( int arr [ ] , int num , int tgt )  
{  
    int beg = 0 , end = num – 1 ;   
    // use loop to check all sorted elements  
    while ( beg < = end )  
    {  
        /* get the mid value of sorted array and then compares with target element. */  
        int mid = ( beg + end ) / 2 ;         
        if ( tgt = = arr [ mid ] )  
        {  
            return mid ; // when mid is equal to tgt value  
        }         
        // check tgt is less than mid value, discard left element  
        else if ( tgt < arr [ mid ] )  
        {  
            end = mid – 1 ;  
        }         
        // if the target is greater than the mid value, discard all elements  
        else {  
            beg = mid + 1 ;  
        }  
    }  
    // return -1 when target is not exists in the array  
    return -1 ;  
}  
int main ( )  
{  
    // declaration of the arrays  
    int arr [ ] = { 5 , 10 , 15 , 20 , 25 , 30 , 37 , 40 } ;  
    int tgt = 25 ; // specified the target element     
    int num = sizeof ( arr ) / sizeof ( arr [ 0 ] ) ;  
    // declare pos variable to get the position of the specified element  
    int pos = bin_search ( arr , num , tgt ) ;     
    if ( pos ! = 1 )  
    {  
        cout << " element is found at position " << ( pos + 1 ) << endl;  
    }  
    else  
    {  
        cout << " element is not found in the array" << endl ;  
    }  
    return 0 ;  
}  

OUTPUT:

element is found at position 5
……………………………………………
Process executed in 2.22 seconds
Press any key to conitinue.

Explanation

We defined an array arr [ ] = { 5 , 10 , 15 , 20 , 25 , 30 , 35 , 40 } in the preceding program, and then we supplied number '25' as the number to seek from the sorted array using the binary search method. As a result, we write the bin search ( ) user-defined function, which searches the supplied integer and returns the message "Element is located at position 5". The bin search ( ) method returns "Element not found in the array" if the number is not specified in the array.

Example 4: Using the recursion function, discover the requested element:

Let's look at an example of utilizing the binary search within the recursion function to see if the provided element is found in the sorted array.

/* find the specified number using the binary search technique inside the recursion method. */  
#include < iostream > 
#include < bits/stdc++.h >
#include < stdlib >
#include < stdio > 
using namespace std;  
// define a function  
int binary_search ( int [ ] , int , int , int ) ;  
int main ( )  
{  
    // declaration of the variables  
    int i , arr [ 100 ] , tgt , num , ind , st , end ;  
    cout << " Define the size of an array: " ;  
    cin >> num ;     
    cout << " enter " << num << " elements in ascending order: " << endl ;  
    // use for loop to ieterate the number  
    for ( i = 0 ; i < num ; i++ )  
    {  
        cout << " arr [ " << i << " ] = " ;  
        cin >> arr [ i ] ;  
    }  
    // define the element to be search  
    cout << " \n enter an element to be searched in ascending array: " ;  
    cin >> tgt ;     
    // ind define the index number  
    ind = binary_search ( arr , 0 , num - 1 , tgt) ;   
    // check for existemce of the specified element  
    if ( ind = = 0 )  
        cout << tgt << " is not available in the array-list" ;     
    else  
        cout << tgt << " is available at position " << ind << endl ;  
    return 0 ;  
}  
// function defnition  
int binary_search ( int arr [ ] , int st , int end , int tgt )  
{  
    int mid ;  
    // check st is greater than end  
    if ( st > end )  
    {  
        return 0 ;  
    }  
    mid = ( st + end ) / 2 ; // get middle value of the sorted array  
      
    // check middle value is equal to target number  
    if (arr [ mid ] == tgt )  
    {  
        return ( mid + 1 ) ;  
    }  
    // check mid is greater than target number  
    else if ( arr [ mid ] > tgt )  
    {  
        binary_search ( arr , st , mid - 1 , tgt ) ;  
    }  
    // check mid is less than target number  
    else if ( arr [ mid ] < tgt )  
    {  
        binary_search ( arr , mid + 1 , end , tgt ) ;   
    }  
}

OUTPUT:

Define the size of an array: 10
Arr [ 0 ] = 2
Arr [ 1 ] = 4
Arr [ 2 ] = 5
Arr [ 3 ] = 8
Arr [ 4 ] = 12
Arr [ 5 ] = 13
Arr [ 6 ] = 27
Arr [ 7 ] = 36
Arr [ 8 ] = 49
Arr [ 9 ] = 51
enter an element to be searched in ascending array: 12
12 is available at position 6.
…………………………………………………………………………………
Process executed in 2.22 seconds
Press any key to continue.

Explanation

We input all items of an array in ascending order in the aforementioned software, and then define a number as the target element, which is '12,' which is found from a sorted array using the binary search method. As a result, we develop the binary search () user-defined function, which searches an array for the given element's location and returns the specific element accessible at that point. It also returns 0 if the element isn't found in the sorted array.