-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMerge_Sort.cpp
More file actions
72 lines (59 loc) · 1.2 KB
/
Copy pathMerge_Sort.cpp
File metadata and controls
72 lines (59 loc) · 1.2 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
#include<iostream>
#include<vector>
using namespace std;
void merge(vector<int>&arr,int low,int mid,int high){
vector<int>temp;
int left = low;
int right = mid+1;
while(low<=mid && right<=high){
if(arr[left]<arr[right]){
temp.push_back(arr[left]);
low++;
}
else{
temp.push_back(arr[right]);
right++;
}
}
while(left<=mid){
temp.push_back(arr[left]);
left++;
}
while(right<=high){
temp.push_back(arr[right]);
right++;
}
for(int i=low;i<=high;i++){
arr[i] = temp[i-low];
}
}
void mergeSort(vector<int>&arr,int low,int high){
if(low==high){
return;
}
int mid = (low+high)/2;
mergeSort(arr,low,mid);
mergeSort(arr,mid+1,high);
merge(arr,low,mid,high);
}
void printarr(vector<int>arr,int n){
for(int i=0;i<n;i++){
cout<<arr[i]<<" ";
}
}
int main()
{
// vector<int>arr{3,1,2,4,1,5,2,6,4};
vector<int>arr;
int n;
cin>>n;
for(int i=0;i<n;i++){
int a;
cin>>a;
arr.push_back(a);
}
// int n = arr.size();
mergeSort(arr,0,n-1);
printarr(arr,n);
return 0;
}