-
Notifications
You must be signed in to change notification settings - Fork 0
/
CodeMergeTwoSortedArrays.cpp
77 lines (61 loc) · 1.24 KB
/
CodeMergeTwoSortedArrays.cpp
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
// You have been given two sorted arrays/lists(ARR1 and ARR2) of size N and M respectively, merge them into a third array/list such that the third array is also sorted.
// Note: Consider the case when size of the two arrays is not same.
// Sample Input 1 :
// 1
// 5
// 1 3 4 7 11
// 4
// 2 4 6 13
// Sample Output 1 :
// 1 2 3 4 4 6 7 11 13
// My Code:
void merge(int arr1[], int size1, int arr2[], int size2, int ans[]){
int i = 0, j = 0, k = 0;
while(i < size1 && j < size2){
if(arr1[i] < arr2[j]){
ans[k++] = arr1[i++];
}
else{
ans[k++] = arr2[j++];
}
}
while(i < size1){
ans[k++] = arr1[i++];
}
while(j < size2){
ans[k++] = arr2[j++];
}
}
// Main Code:
#include <iostream>
using namespace std;
#include "solution.h"
int main()
{
int t;
cin >> t;
while (t--)
{
int size1;
cin >> size1;
int arr1[size1];
for (int i = 0; i < size1; i++)
{
cin >> arr1[i];
}
int size2;
cin >> size2;
int arr2[size2];
for (int i = 0; i < size2; i++)
{
cin >> arr2[i];
}
int ans[size1+size2];
merge(arr1, size1, arr2, size2, ans);
for (int i = 0; i < size1 + size2; i++)
{
cout << ans[i] << " ";
}
cout << endl;
}
}