-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmerge_sort_array.c
44 lines (38 loc) · 1003 Bytes
/
merge_sort_array.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <stdio.h>
int main()
{
int i1, j1, array1[10], array2[10], merged[20], a, i, j;
printf("enter the size of an array1 (must be less than 10): ");
scanf("%d", &i1);
for (i = 0; i < i1; i++)
{
printf("enter array1[%d]: ", i + 1);
scanf("%d", &array1[i]);
}
printf("\nenter the size of an array2 (must be less than 10): ");
scanf("%d", &j1);
for (i = 0; i < j1; i++)
{
printf("enter array2[%d]: ", i + 1);
scanf("%d", &array2[i]);
}
for (i = 0; i < i1; i++)
merged[i] = array1[i];
for (i = 0; i < j1; i++)
merged[i + i1] = array2[i];
printf("Sorted Array is: ");
for (i = 0; i < i1 + j1; i++)
{
for (j = i + 1; j < i1 + j1; j++)
{
if (merged[i] > merged[j])
{
a = merged[i];
merged[i] = merged[j];
merged[j] = a;
}
}
printf("%d ", merged[i]);
}
return 0;
}