Notes

#include<iostream>
using namespace std;
int linearsearch(int a[20],int key,int n);
int binarysearch(int a[20],int key,int n);
int main()
{
int a[20],k,n,ch,ans,i;
cout<<"Enter the total number of elementsn";
cin>>n;
while(1){
cout<<"nMenun";
cout<<"1.linear searchn";
cout<<"2.binary searchn";
cout<<"3.exitn";
cout<<"Enter your choicen";
cin>>ch;
switch(ch){
case 1:
cout<<"Enter the elementsn";
for(i=0;i<n;i++){
cin>>a[i];
}
cout<<"Enter the key elememtsn";
cin>>k;
ans=linearsearch(a,k,n);
if(ans!=-1)
cout<<"elementt"<<k<<"tis foundn";
else
cout<<"Elementt"<<k<<"tis not foundn";
break;
case 2:
cout<<"Enter the elementsn";
for(i=0;i<n;i++){
cin>>a[i];
}
cout<<"Enter the key elememtsn";
cin>>k;
ans=binarysearch(a,k,n);
if(ans!=-1)
cout<<"elementt"<<k<<"tis foundn";
else
cout<<"Elementt"<<k<<"tnot foundn";
break;
case 3:
exit(0);
default:
cout<<"Invalid entryn";
}
}
}
int linearsearch(int a[20],int key,int n)
{
int i;
for(i=0;i<n;i++){
if(key==a[i])
return i;
}

return -1;
}
int binarysearch(int a[20],int key,int n)
{
int high,low,mid;
low=0;
high=n-1;
while(low<=high){
mid=(low+high)/2;
if(a[mid]==key)
return mid;
else if(a[mid]<key)
low=mid+1;
else
high=mid-1;
}
return -1;
}