-
Notifications
You must be signed in to change notification settings - Fork 0
/
Merge Sort
45 lines (39 loc) · 1 KB
/
Merge Sort
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
void copyArray(int arr[], int low, int hi, int aux[])
{
int i;
for (i = low; i < hi; i = i + 1)
{
arr[i] = aux[i];
}
}
void mergeArrays(int arr[], int low, int mid, int hi, int aux[])
{
int lowPosition = low;
int midPosition = mid;
int i;
for (i = low; i < hi; i = i + 1)
{
if ( lowPosition < mid && (arr[lowPosition] < arr[midPosition] || midPosition >= hi) )
{
aux[i] = arr[lowPosition];
lowPosition = lowPosition + 1;
}
else
{
aux[i] = arr[midPosition];
midPosition = midPosition + 1;
}
}
}
void mergeSort(int arr[], int lowerBound, int upperBound, int aux[])
{
if (upperBound - lowerBound < 2)
{
return;
}
int mid = (lowerBound + (upperBound - lowerBound)/2);
mergeSort(arr, lowerBound, mid, aux);
mergeSort(arr, mid, upperBound, aux);
mergeArrays(arr, lowerBound, mid, upperBound, aux);
copyArray(arr, lowerBound, upperBound, aux);
}