Question

Write a C program.

Problem 1: You are given two sorted arrays, A and B, and A has a large enough buffer at the end to hold B. Write a method to merge B into A in sorted order without using any other array space. Implementation instruction:

(1) Define one array of size 18 for A and the other array of size 5 for B.

(2) Initialize A by inputting 13 integers in the ascending order, and Initialize B by inputting 5 integers in the ascending order. (Note: don’t hard code the integers of the arrays.)

(3) Merge B with A in a way all values are sorted.

(4) Print out the updated array A, after merging with B. For example: If your input for A is 1, 3, 11, 15, 20, 25, 34, 54, 56, 59, 66, 69, 71 and your input for B is 2, 4, 5, 22, 40 Finally, after merging A and B, A becomes 1, 2, 3, 4, 5, 11, 15, 20, 22, 25, 34, 40, 54, 56, 59, 66, 69, 71

Answer 1

The program is given below: that define two array A and B, initialize array by taking integers in the ascending order from user, then call merge() method that merge B with A in a way all values are sorted, print updated array A, after merging with B.

#include <stdio.h>
//merge() method merge B with A in a way all values are sorted
void merge(int A[],int B[])
{
int i=13-1,j=5-1;
int k=17;
//continue until j greater than equal 0
while(j>=0)
{ //if i is greater than equal 0 and A[i] is greater than B[j]
if(i>=0 && A[i]>B[j])
{ //set A[k] equal to A[i]
A[k]=A[i];
//decrement i by 1
i--;
}
else
{ //set A[k] equal to B[j]
A[k]=B[j];
//decrement j by 1
j--;
}
//decrement k by 1
k--;
}
}
int main()
{
//define two array A and B
int A[18],B[5],i;
//execute for loop from 0 to 13
for(i=0;i<13;i++)
{ //take integers in the ascending order from user
scanf("%d",&A[i]);
}
//execute for loop from 0 to 5
for(i=0;i<5;i++)
{ //take integers in the ascending order from user
scanf("%d",&B[i]);
}
//call merge() method that merge B with A in a way all values are sorted
merge(A,B);
  
//Print updated array A, after merging with B
printf("\n");
for(i=0;i<18;i++)
{
printf("%d ",A[i]);
}
return 0;
}

The screenshot of code is given below:

Input:

1 3 11 15 20 25 34 54 56 59 66 69 71
2 4 5 22 40

Output: