Question

in c++

Class Assignment Nov-1: Write the binary search in template form.

Answer 1

Binary Search template in CPP - binary_search() is a function defined in the standard template library of c++. We will use this function to implement binary search.

We will use "algorithm" , C++ standard library.

Syntax-

binary_search(S_A,E_A,data)

S_A=First element pointer

E_A=Last element pointer

data=element to search.

----------------------------------------------------------------------------------------------------------------------------------------------------------------------Code-

#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
int n,element; //element to take input size o array, element=element to search
cout<<"Enter size of the array : ";
cin>>n;

int arr[n]; //declaring array of size n
cout<<"\nEnter array elements : ";
for(int i = 0; i < n; i++)
cin >> arr[i];

//used in built sort func
sort(arr, arr+n);

cout<<"\nsorted elements are : ";
for(int i = 0; i < n; i++)
cout <<" "<< arr[i];

cout<<"\nEnter element to search : ";
cin>>element;

if(binary_search(arr, arr+ n, element))
cout<<"\npresent in array\n";
else
cout<<"\nnot present in array\n";

return 0;
}
----------------------------------------------------------------------

Code Screenshot-

-------------------------------------------------------------------------------------------

CUsers Shradhda\Documents binary.cpp - Sublime Text File Edit Selection Find View Goto Tools Project Preferences Help binary po 1 2 #include <iostream> #include <algorithm 4 using namespace std; 6 int main() int n,element; //element to take input size o array, element-element to search cout<<"Enter size of the array : "; cin>>n; int arr[n]; //declaring array of size n cout<<"\nEnter array elements : "; tor(int i - 0; i<n; i++) cin >> arr[i]; 16 //used in built sort func sort(arr, arrin); cout<<"\nsorted elements are : "; for(int i = 0; i<n; i++) cout <<" "<< arr[i]; cout<<"\nEnter element to search : "; cin>>element; if(hinary_search(arr, arrt n, element)) cout<<"\npresent in array\n"; else cout<<"\nnot present in array\n"; return 0; 34 2 lines. 4 characters selected - 20 Eie SOPO. Space 4 C- 4.) ENG 10:53 A D

Output Screenshot-

ols Film 1 #include <iostream> C:\Users\Shradhda\Documents\binary.exe Enter size of the array : 5 Enter array elements : 4 6 3 7 8 sorted elements are : 34 6 7 8 Enter element to search : 6 present in array execution time : 12.468 sı Process returned o (0x0) Press any key to continue.