Toggle navigation
Log in
Sign Up
Log in
Sign Up
Appium
C
C#
C++
Docker
Go
Informatica
Java
JavaScript
Kafka
Numpy
Oracle
Pandas
PHP
Py Spark
Python
R
React Native
Scipy
SFTP
Tableau
Teradata
TGMC
UNIX
Introducing
Radical.sh
Forget Code launches a powerful code generator for building API's
Forget_Code.Models.CategoryViewModel
Add a new snippet
Access Specifier
1
Algorithms
9
Applications
2
Array
8
Basics
7
Classes
10
Control Statements
5
Conversion Functions
16
Data Structures
13
Exception Handling
8
File
33
Generics
19
Keywords
3
Loops
6
Math Functions
1
Math Snippets
2
Memory Management
3
Misc
1
OOPS
24
Operators
23
Pointers
13
String Functions
1
String Snippets
9
Type Casting
5
Unit Testing
1
Choose Category
Linear Search with Template in C++
Forget Code
C++
Linear Search with Template
#include<iostream>
using namespace std;
template <class T>
void Lsearch(T *a, T item, int n)
{
int z=0;
for(int i=0;i<n;i++)
{
if(a[i]== item)
{
cout<<"\n Item found at position = "<<i+1<<"\n\n";
z=1;
return;
}
}
cout<<"\nNot Found\n\n";
}
int main()
{
int arrayInt[10] = {2,42,56,86,87,99,323,546,767,886};
double arrayDouble[6]= {2.4, 5.53,44.4, 54.45, 65.7,89.54};
int itemI;
double itemD;
cout<<"\n Elements of Integer Array \n";
for(int i=0;i<10;i++)
{
cout<<arrayInt[i]<<" ";
}
cout<<"/n Enter an item to be search: ";
cin>>itemI;
cout<<"\n\n Linear Search Method\n";
Lsearch(arrayInt,itemI,10);
cout<<"\n Elements of double Array \n";
for(int i=0;i<6;i++)
{
cout<<arrayDouble[i]<<" ";
}
cout<<"\n Enter an item to be search: ";
cin>>itemD;
cout<<"\n\n Linear Search Method\n";
Lsearch(arrayDouble,itemD,6);
return 0;
}
Tags for Linear Search with Template in C++
Array
linear search
template
Contribute to Forget Code, help others.
Add snippet