Drop Down MenusCSS Drop Down MenuPure CSS Dropdown Menu

Operation of Linear Array (traverse,search,insert,delete)..

Program for all Operation of Singular ARRAY ,
1 Traversing                2 Searching
3 Insertion                    4 Deletion
use of switch case and function calling technique to reduce the complexity of program..






Source Code:-

#include<iostream.h>
#include<conio.h>
void traversing (int*,int);
void searching  (int*,int,int);
void insertion  (int*,int,int,int);
int  deletion   (int*,int,int);
void main()
{ clrscr();
  int array[30],choice,location,item,i,length,position;
  cout<<"Program for Operation of Array by-Tarun Rawat \n";
  cout<<"\nEnter length of array : ";
  cin>>length;
  cout<<"Enter element of array \n";
  for(i=0;i<=length-1;i++)
     { cin>>array[i];
     }
  again:
  cout<<"Travers= 1\nSearch = 2\nInsert = 3\nDelete = 4\nExit   = 5 \n";
  cout<<"Enter choice: ";
  cin>>choice;
  switch(choice)
      { case 1:       traversing(array,length);
      break;
case 2:       searching(array,item,length);
      break;
case 3:       cout<<"Enter Item and Position to add \n";
      cin>>item>>position;
      insertion(array,length,item,position);
      for(i=0;i<=length;i++)
      {cout<<array[i]<<endl;
      }
      break;
case 4:       cout<<"Enter position to delete \n";
      cin>>position;
      length =deletion(array,length,position);
      cout<<"New array after delete \n";
      for(i=0;i<length;i++)
 {cout<<array[i]<<"\n";}
      break;
case 5:       break;
default:       cout<<"wrong value\n";
goto again;
      }
getch();
}

void traversing(int array[],int length)
     {  for(int i=0;i<=length-1;i++)
   {cout<<array[i]<<"  ";}
     }

void searching(int array[],int item,int length)
    { int i;
      cout<<"\nEnter item to search \n";
      cin>>item;
      int location =-1;
      for( i=0;i<=length-1;i++)
{ if ( array[i]==item)
     { location=i;
     }
}
if (location==-1)
     {cout<<"\nItem not found ";
      }
else{cout<<" \nItem is present at (index value): "<<location;
    }
    }

void insertion(int array[],int length,int item,int position)
    { int j=length-1;
      while(j>=position)
   {  array[j+1]=array[j];
     j=j-1;
   }
   array[position]=item;
   length=length+1;
    }

int deletion(int array[],int length,int position)
   {
      while(position<length)
  { array[position]=array[position+1];
    position=position+1;
  }
      length=length-1;
      return length;

   }

5 comments:

Blogger Widgets

Find Us On Google, Just type - way2cplusplus -

If you have any questions on implementing or understanding this C++ Program , shoot me a comment and I'll be glad to help! :) :)