-
Notifications
You must be signed in to change notification settings - Fork 44
/
Merge Sort.cpp
101 lines (78 loc) · 1.48 KB
/
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
94
95
96
97
98
99
100
101
// ---- AI Programming ------
//Implementation of Merge Sort using C++
// Join our underground coding movement
// @freecodecs (c) May, 2019
#include<iostream>
using namespace std;
void merge(int arr[], int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1+ j];
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1)
{
arr[k] = L[i];
i++;
k++;
}
while (j < n2)
{
arr[k] = R[j];
j++;
k++;
}
}
void mergeSort(int arr[], int l, int r)
{
if (l < r)
{
int m = l+(r-l)/2;
mergeSort(arr, l, m);
mergeSort(arr, m+1, r);
merge(arr, l, m, r);
}
}
void display(int arr[], int size)
{
int i;
for (i=1; i < size; i++)
cout<<arr[i]<<", ";
}
int main()
{
int size;
cout<<"\nEnter the size of elements : ";
cin>>size;
int arr[size];
cout<<"\nBy using space enter the unsorted elements : ";
for (int i = 0; i < size; ++i)
{
cin>>arr[i];
}
mergeSort(arr, 0, size);
cout<<"\nSorted elements are : ";
display(arr, size);
return 0;
}