solution of balagurusamy of chapter 7.6

#include<stdio.h>
main()
{
int a[21],b[21],c[21],i,j,n,d=1,e=0;
printf("Enter n= ");
scanf("%d",&n);
printf("Array a:\n");
for(i=1;i<=n;++i)
{
printf("a[%d]= ",i);
scanf("%d",&a[i]);
}
printf("Array b:\n");
for(i=1;i<=n;++i)
{
printf("b[%d]= ",i);
scanf("%d",&b[i]);
}
for(i=1;i<=n;++i)
{
 for(j=d;j<=n;++j)
 {
  e+=1;
  if(a[i]<=b[j])
  {
  c[e]=a[i];
  break;
  }
  else
  {
  c[e]=b[j];
  i-=1;
  d+=1;
  break;
  }
 }
}
e+=1;
if(a[n]<b[n])
c[2*n]=b[n];
else
c[2*n]=a[n];
printf("Merged sorted array:\n");
for(i=1;i<=e;++i)
{
printf("%d\n",c[i]);
}
return 0;
}