You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
91 lines
1.7 KiB
C
91 lines
1.7 KiB
C
/*
|
|
* C Program to Merge the Elements of 2 Sorted Array
|
|
*/
|
|
#include <stdio.h>
|
|
|
|
void main()
|
|
{
|
|
int array1[50], array2[50], array3[100], m, n, i, j, k = 0;
|
|
printf("\n Enter size of array Array 1: ");
|
|
scanf("%d", &m);
|
|
printf("\n Enter sorted elements of array 1: \n");
|
|
for (i = 0; i < m; i++)
|
|
{
|
|
scanf("%d", &array1[i]);
|
|
}
|
|
printf("\n Enter size of array 2: ");
|
|
scanf("%d", &n);
|
|
printf("\n Enter sorted elements of array 2: \n");
|
|
for (i = 0; i < n; i++)
|
|
{
|
|
scanf("%d", &array2[i]);
|
|
}
|
|
i = 0;
|
|
j = 0;
|
|
while (i < m && j < n)
|
|
{
|
|
if (array1[i] < array2[j])
|
|
{
|
|
array3[k] = array1[i];
|
|
i++;
|
|
}
|
|
else
|
|
{
|
|
array3[k] = array2[j];
|
|
j++;
|
|
}
|
|
k++;
|
|
}
|
|
if (i >= m)
|
|
{
|
|
while (j < n)
|
|
{
|
|
array3[k] = array2[j];
|
|
j++;
|
|
k++;
|
|
}
|
|
}
|
|
if (j >= n)
|
|
{
|
|
while (i < m)
|
|
{
|
|
array3[k] = array1[i];
|
|
i++;
|
|
k++;
|
|
}
|
|
}
|
|
printf("\n After merging: \n");
|
|
for (i = 0; i < m + n; i++)
|
|
{
|
|
printf("\n%d", array3[i]);
|
|
}
|
|
}
|
|
|
|
/*
|
|
|
|
Enter size of array Array 1: 4
|
|
|
|
Enter sorted elements of array 1:
|
|
12
|
|
18
|
|
40
|
|
60
|
|
|
|
Enter size of array 2: 4
|
|
|
|
Enter sorted elements of array 2:
|
|
47
|
|
56
|
|
89
|
|
90
|
|
|
|
After merging:
|
|
|
|
12
|
|
18
|
|
40
|
|
47
|
|
56
|
|
60
|
|
89
|
|
90
|