Insert, Delete, Travers, Merge

GXTechno Tags: insert, delete, travers, merge, data, structure, c

C Data Structures Algorithms Vid [VHS]
//WAP to insert, delete, traverse, merge with array
#include<stdio.h>
#include<conio.h>
void insert();
void del();
void traversa();
void merged();
int a[10],i=-1;
void main()
{
int n;
//clrscr();
do
{
printf("***************************** YOUR CHOICES ARE ****************************\n");
printf("1. Insert\n");
printf("2. Delete\n");
printf("3. Traverse\n");
printf("4. Merged\n");
printf("5. Exit\n");
printf("NOW ENTER YOUR CHOICE :\n");
scanf("%d",&n);
switch(n)
{
case 1:
insert();
break;
case 2:
del();
break;
case 3:
traversa();
break;
case 4: merged();
break;
case 5:
break;
default:
printf("SORRY!YOUR CHOICE IS INVALID!!");
}
}while(n!=5);
getch();
}

void insert()                //Body of insert function
{
    if(i<=8)
    {
        printf("Enter the No.(10 elements)\n");
        while(i<=8)
        {
        i++;
        scanf("%d",&a[i]);
        }
    }
    else
    {
        printf("The Array is Full");
    }
}

void del()                //Body of del function
{
int item,j,flag=0,pos;
printf("Enter the no to delete : ");
scanf("%d",&item);
for(j=0;j<=i;j++)
{
    if(a[j]==item)
    {
    flag=1;
    pos=j;
    }
}
if(flag)
{
for(j=pos;j<=i;j++)
    {
    a[j]=a[j+1];
    }
    i--;
}
else
{
printf("The no is not in list, Sorry\n");
}
}

void traversa()                //Body of traversa function
  {
  int j;
for(j=0;j<=i;j++)
    {
    printf("%d\n",a[j]);
    }

}
void merged()
{
int p,q,m,n,c;
int array1[100],array2[100],array3[200];
puts("Enter number of elements of the first sorted array");
scanf("%d",&p);
puts("Enter element of the first sorted array");
for(m=0;m<=p;m++)
scanf("%d",&array1[m]);
puts("Enter number of elements of the second sorted array");
scanf("%d",&q);
puts("Enter element of the second array");
for(n=0;n<=q;n++)
scanf("%d",&array2[n]);
c=0;
m=0;
n=0;
while((m<q)&&(n<q))
{
if(array1[m]<=array2[n])
array3[c]=array1[m++];
else
array3[c]=array2[n++];
c++;
}
while(m<p)
{
array3[c]=array1[m];
c++;
m++;
}
while(n<q)
{
array3[c]=array2[n];
c++;
n++;
}
puts("merged array in ascending order : ");
for(m=0;m<=c;m++)
printf("%d\n",array3[m]);
}