data_struct/merge_sort(48).cpp at master · dharm4811/data_struct · GitHub

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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include<iostream>
using namespace std;
#define MAX 100
class merging
{
int *a;
int *b;
int *c;
int size1,size2;
public:
	merging()
	{
		a = new int[MAX];
			cout<<"\nenter the size of array a : ";
	cin>>size1;
		b=new int [MAX];
			cout<<"\nenter the size of array b : ";
	cin>>size2;
			c=new int [size1+size2];
	}

void insert_a()
{


	cout<<"\nEnter "<<size1<<" elements in array a\n";

	for( int i=0 ;i<size1;i++)
	{
		cin>>a[i];
	}

return ;
	}


void insert_b()
{

	cout<<"\nEnter "<<size2<<" elements in array b\n";
	for(int i=0;i<size2;i++)
	{
		cin>>b[i];

	}


}
void merge()
{
int i = 0;	int j=0;
int k =0;
while(i<size1 && j<size2)
{
	if(a[i]<b[j])
	{
		c[k] = a[i];
		k++;
		i++;
	}
	else
	{
		c[k] = b[j];
		j++;
		k++;
	}
}
  while(i<size1)
  {
  	c[k]=a[i];
  	k++;
  	i++;
	  }

	while(j<size2)
	{
		c[k]=b[j];
		k++;
		j++;
	  }


cout<<"\n after merging :\n";
for(int g = 0;g<size1+size2;g++)
{
	cout<<c[g];
	cout<<"\t";
}
}


};
int main()

{
	merging obj;


	obj.insert_a();


	obj.insert_b();


	obj.merge();


return 0;
}