95
To implement traversal,insertion,deletion in a linear array. CODE: #include<iostream> using namespace std; int main() { int a[20],numb,pos,x,flag=0; cout<<"Enter 10 elements of array:"<<endl; for(int i=1;i<=10;i++) {cin>>a[i];} cout<<"\n\n1-TRAVERSE"<<endl; cout<<"2-INSERTION"<<endl; cout<<"3-DELETION"<<endl; cin>>x; if(x==1) { cout<<"\nEnter number to be searched:"; cin>>numb; for(int i=1;i<=10;i++) {if(a[i]==numb) {pos=i; cout<<"The position of number is:"<<pos<<endl; flag++;}} if(flag==0) cout<<"Number not in the series."<<endl; } else if(x==2) { cout<<"\nEnter number to be inserted:"; cin>>numb; cout<<"Enter position where number is to be inserted:"; cin>>pos; for(int i=11;i>=pos;i--) a[i]=a[i-1]; a[pos]=numb; cout<<"The new array is:"<<endl; for(int i=1;i<=11;i++) cout<<a[i]<<endl; } else if(x==3)

Data Structure

  • Upload
    kartik

  • View
    216

  • Download
    1

Embed Size (px)

DESCRIPTION

ds

Citation preview

To implement traversal,insertion,deletion in a linear array.CODE:

#includeusing namespace std;int main(){int a[20],numb,pos,x,flag=0;cout