-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQuiz1a.cpp
More file actions
86 lines (81 loc) · 1.36 KB
/
Quiz1a.cpp
File metadata and controls
86 lines (81 loc) · 1.36 KB
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
78
79
80
81
82
83
84
85
86
#include <iostream>
#include <conio.h>
using namespace std;
void mergeSort(int arr1[],int arr2[],int size)
{
int arr[size+size];
int j = 0;
int k = 0;
int ctr = 0;
for(int i = 0;i<(size+size);i++)
{
if (j >= size) {
arr[ctr] = arr2[k];
k++;
} else if (k >= size) {
arr[ctr] = arr1[j];
j++;
} else if(arr1[j]<arr2[k])
{
arr[ctr] = arr1[j];
j++;
ctr++;
}
else if(arr1[j]>arr2[k])
{
arr[ctr] = arr2[k];
k++;
ctr++;
}
else if(arr1[j]==arr2[k])
{
arr[ctr] = arr2[k];
ctr++;
arr[ctr] = arr1[j];
k++;
j++;
ctr++;
}
// else if(ctr == size*2)
// {
// break;
// }
}
cout<<"Sorted. \n";
for(int m = 0;m<size*2;m++)
{
cout<<arr[m]<<" ";
}
cout<<endl;
}
int main()
{
int size;
cout<<"Enter size of arrays: ";
cin>>size;
int array1[size];
int array2[size];
for(int i = 0; i<size;i++)
{
cout<<"Enter "<<i+1<<" element for Array 1: ";
cin>>array1[i];
cout<<endl;
}
for(int a = 0;a<size;a++)
{
cout<<"Enter "<<a+1<<" element for Array 2: ";
cin>>array2[a];
cout<<endl;
}
for(int l = 0;l<size;l++)
{
cout<<array1[l]<<" ";
}
cout<<endl;
for(int n = 0;n<size;n++)
{
cout<<array2[n]<<" ";
}
cout<<endl;
mergeSort(array1,array2,size);
}