Datastru PDF
Datastru PDF
EXPERIMENT NO.-01
#include<iostream>
using namespace std;
int main()
{
int ar[20],i,k,item,n;
cout<<"enter no of elements"<<endl;
cin>>n;
cout<<"enter elements"<<endl;
for(i=0;i<n;i++)
cin>>ar[i];
cout<<"enter the postion u want to enter"<<endl;
cin>>k;
cout<<"enter the element which u want to enter"<<endl;
cin>>item;
for(i=n-1;i>=k;i--)
ar[i+1]=ar[i];
ar[k]=item;
cout<<"display"<<endl;
for(i=0;i<=n;i++)
cout<<ar[i];
return 0;
}
1.2- to delete an element when position is given.
Ans-CODE:
#include<iostream>
using namespace std;
int main()
{
int ar[20],i,k,n;
cout<<"enter no of elements u want to print"<<endl;
cin>>n;
cout<<"enter elements"<<endl;
for(i=0;i<n;i++)
cin>>ar[i];
cout<<"enter the posiont u want to delete "<<endl;
cin>>k;
for(i=k;i<n-1;i++)
ar[i]=ar[i+1];
cout<<"display"<<endl;
for(i=0;i<n-1;i++)
cout<<ar[i];
return 0;
}
1.3-to find location of given position
Ans- CODE:
#include<iostream>
using namespace std;
int main()
{
int ar[20],i,k,n,j,loc;
cout<<"enter no of elements u want to print"<<endl;
cin>>n;
cout<<"enter elements"<<endl;
for(i=0;i<n;i++)
cin>>ar[i];
cout<<"enter the element u want to search"<<endl;
cin>>k;
for(i=0;i<n;i++)
{
if (ar[i]==k)
{
j=1;
loc=i;
break;
}
}
if(j==1)
{cout<<"search suucesfull"<<endl;
cout<<"location is "<<loc;
}
else
cout<<"search is unsucessfull"<<endl;
return 0;
}
Ans- CODE:
#include<iostream>
using namespace std;
int main()
{
int ar[20],i,k,item,n;
cout<<"enter no of elements"<<endl;
cin>>n;
cout<<"enter elements"<<endl;
for(i=0;i<n;i++)
cin>>ar[i];
for(i=0;i<n;i++)
cout<<ar[i]<<endl;
return 0;
}