forked from Amisha-here/Data-Structures
-
Notifications
You must be signed in to change notification settings - Fork 0
/
merge_sort.cpp
93 lines (65 loc) · 974 Bytes
/
merge_sort.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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#include<iostream>
using namespace std;
void merge(int *a,int *x,int *y,int s,int e){
int i = s;
int mid = (s+e)/2;
int j = mid+1 ;//start of y
int k = s;
while(i<=mid && j<=e){
if(x[i]<y[j]){
a[k]=x[i];
k++;
i++;
}
else{
a[k]=y[j];
k++;
j++;
}
}
while(i<=mid){
a[k]=x[i];
i++;
k++;
}
while(j<=e){
a[k]=y[j];
k++;
j++;
}
return;
}
void mergesort(int *a ,int s ,int e){
//ase co
if(s==e){
return;
}
int x[100];
int y[100];
int mid = (s+e)/2;
for(int i= s;i<=mid;i++){
x[i]=a[i];
}
for(int i=mid+1;i<=e;i++){
y[i]=a[i];
}
//recusion
mergesort(x,s,mid);
mergesort(y,mid+1,e);
//merge 2 sorted array
merge(a,x,y,s,e);
}
int main()
{
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
mergesort(a,0,n-1);
for(int i=0;i<n;i++){
cout<<a[i]<<" ";
}
return 0;
}