-
Notifications
You must be signed in to change notification settings - Fork 11
/
Merge sort Algorithm in C++
76 lines (52 loc) · 971 Bytes
/
Merge sort Algorithm in C++
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
#include<bits/stdc++.h>
using namespace std;
void Merge(int arr[], int l, int mid, int h){
int n=mid-l+1;
int m=h-mid;
int a[n];
int b[m];
for(int i=0;i<n;i++){
a[i]=arr[l+i];
}
for(int i=0;i<m;i++){
b[i]=arr[mid+1+i];
}
int i=0;
int j=0;
int k=l;
while(i<n && j<m){
if(a[i]<b[j]){
arr[k]=a[i];
i++; k++;
}
else{
arr[k]=b[j];
j++; k++;
}
}
while(i<n){
arr[k]=a[i];
k++; i++;
}
while(j<m){
arr[k]=b[j];
k++; j++;
}
}
void MergeSort(int arr[] ,int l,int h)
{
if(l<h){
int mid = (l+h)/2;
MergeSort(arr ,l , mid);
MergeSort(arr , mid+1, h);
Merge(arr , l ,mid , h);
}
}
int main(){
int arr[]={5,4,3,2,1};
MergeSort(arr,0,4);
for(int i=0;i<5;i++){
cout<<arr[i]<<" ";
}
cout<<endl;
}