Write A C Program That Merge Two Array In Sorted Order

Code:

1. #include<stdio.h>
2. #include<stdlib.h>
3. void merge(int *arr,int *brr,int m,int n)
4. {
5. int i=0,j=0,k=0;
6. int *crr;
7. int l=(n+m);
8. crr=(int*)malloc(l*sizeof(int));
9. while(i<n && j<m)
10. {
11. crr[k++]=arr[i]<brr[j]?arr[i++]:brr[j++];
12. }
13. while(i<n)
14. {
15. crr[k++]=arr[i++];
16. }
17. while(j<m)
18. {
19. crr[k++]=brr[j++];
20. }
21. printf("After merging two array\n");
22. for(k=0;k<l;k++)
23. {
24. printf("%d\n",crr[k]);
25. }
27. }
28. int main()
29. {
30. int *arr,*brr,m,n,i;
31. printf("Enter the size of first array\n");
32. scanf("%d",&n);
33. arr=(int*)malloc(n*sizeof(int));
34. printf("Enter the elements of first array\n");
35. for(i=0;i<n;i++)
36. {
37. scanf("%d",&arr[i]);
38. }
39. printf("Enter the size of second array\n");
40. scanf("%d",&m);
41. brr=(int*)malloc(m*sizeof(int));
42. printf("enter the elements of second array\n");
43. for(i=0;i<m;i++)
44. {
45. scanf("%d",&brr[i]);
46. }
47. printf("First array is-->\n");
48. for(i=0;i<n;i++)
49. {
50. printf("%d\n",arr[i]);
51. }
52. printf("Second array-->\n");
53. for(i=0;i<m;i++)
54. {
55. printf("%d\n",brr[i]);
56. }
57. merge(arr,brr,m,n);
58. return 0;
59. }

Hint: In line 12 we use ternary operator. crr[k++]=arr[i]<brr[j]?arr[i++]:brr[j++]; . This line means if arr[i]<brr[j] is true then this arr[i++] value assign to array crr[k++] and both arr[] and crr[] array increased by 1.If crr[k++]=arr[i]<brr[j] false then this brr[j++] value assign to crr[k++] and both brr[] and crr[] array increased by 1.

Line 16 and 20 means if any value of arr[] or brr[] still can't assigned to crr[] then it will be assigned.

Input:

Enter the size of first array

5

Enter the elements of first array

1

2

3

4

5

Enter the size of second array

5

enter the elements of second array

6

7

8

9

10

First array is-->

1

2

3

4

5

Second array-->

6

7

8

9

10

Output:

After merging two array

1

2

3

4

5

6

7

8

9

10