-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathmerge_sort.cpp
More file actions
54 lines (54 loc) · 1.37 KB
/
merge_sort.cpp
File metadata and controls
54 lines (54 loc) · 1.37 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
#include<iostream>
using namespace std;
void merge(int *arr, int s, int e) {
int mid = (s+e)/2;
int len1 = mid - s + 1;
int len2 = e - mid;
int *first = new int[len1];
int *second = new int[len2];
int mainArrayIndex = s;
for(int i=0; i<len1; i++) {
first[i] = arr[mainArrayIndex++];
}
mainArrayIndex = mid+1;
for(int i=0; i<len2; i++) {
second[i] = arr[mainArrayIndex++];
}
int index1 = 0;
int index2 = 0;
mainArrayIndex = s;
while(index1 < len1 && index2 < len2) {
if(first[index1] < second[index2]) {
arr[mainArrayIndex++] = first[index1++];
}
else{
arr[mainArrayIndex++] = second[index2++];
}
}
while(index1 < len1) {
arr[mainArrayIndex++] = first[index1++];
}
while(index2 < len2 ) {
arr[mainArrayIndex++] = second[index2++];
}
delete []first;
delete []second;
}
void mergeSort(int *arr, int s, int e) {
if(s >= e) {
return;
}
int mid = (s+e)/2;
mergeSort(arr, s, mid);
mergeSort(arr, mid+1, e);
merge(arr, s, e);
}
int main() {
int arr[15] = {3,7,0,1,5,8,3,2,34,66,87,23,12,12,12};
int n = 15;
mergeSort(arr, 0, n-1);
for(int i=0;i<n;i++){
cout << arr[i] << " ";
} cout << endl;
return 0;
}