-
Notifications
You must be signed in to change notification settings - Fork 0
/
SearchingSoring-MergeSortAlgo.cpp
90 lines (73 loc) · 1.78 KB
/
SearchingSoring-MergeSortAlgo.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
/* Merge Sort algorithm
time Complexity O(n*log(n)
*/
#include <bits/stdc++.h>
using namespace std;
void merge(int *arr, int *L , int leftcount, int *R , int rightcount)
{
int i = 0, j = 0, k = 0;
while (i < leftcount && j < rightcount)
{
if (L[i] < R[j])
{ // modifying arr if L[i] less than R[j] and increament i,k for next comparison
arr[k] = L[i];
k++;
i++;
}
else
{
// modifying arr if R[j] greater than L[i] and increament j,k for next comparison
arr[k] = R[j];
k++;
j++;
}
}
// this case arrived when either i or j reach to max iteration
// then remaining element can placed as it is i.e
// arr[5,6,7] L[11 12 13]
while (i < leftcount)
{
arr[k] = L[i];
k++;
i++;
//arr[5,6,7,11,12,13]
}
while (j < rightcount)
{
arr[k] = R[j];
k++;
j++;
}
}
void mergeSort(int arr[], int n)
{
int mid ;
if(n<2) {
return;
}
mid = n / 2;
int L[mid];
int R[n-mid];
for (int i = 0; i < mid; i++)
{
L[i] = arr[i];
}
for (int i = mid; i < n; i++)
{
R[i - mid] = arr[i];
}
mergeSort(L, mid);
mergeSort(R, n - mid);
merge(arr, L, mid, R, n - mid);
}
int main()
{
// int arr[] = {12, 11, 13, 5, 6, 7};
int arr[] = {6, 2, 3, 1, 9, 10, 15, 13, 12, 17};
int sizeofarr = sizeof(arr) / sizeof(arr[0]);
mergeSort(arr, sizeofarr);
for(int i=0;i<sizeofarr;i++){
cout<<arr[i]<<" ";
}
cout<<"\n";
}