-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeSort.cs
More file actions
60 lines (51 loc) · 1.45 KB
/
Copy pathMergeSort.cs
File metadata and controls
60 lines (51 loc) · 1.45 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
55
56
57
58
59
60
namespace CodingProblems
{
public class MergeSort
{
public void DoMerge(int[] array, int left, int mid, int right)
{
int leftEnd = mid - 1;
int tmpPos = left;
int numElements = (right - left + 1);
int[] temp = new int[numElements];
while ((left <= leftEnd) || (mid <= right))
{
if (array[left] <= array[mid])
{
temp[tmpPos++] = array[left++];
}
else
{
temp[tmpPos++] = array[mid++];
}
}
while (left <= leftEnd)
{
temp[tmpPos++] = array[left++];
}
while (mid <= right)
{
temp[tmpPos++] = array[mid++];
}
for (int i = 0; i < numElements; i++)
{
array[right--] = temp[tmpPos--];
}
}
public void DoMergeSort(int[] array, int left, int right)
{
int mid;
if (left < right)
{
mid = (left + right) / 2;
DoMergeSort(array, left, mid);
DoMergeSort(array, mid + 1, right);
DoMerge(array, left, (mid + 1), right);
}
}
public void Merge(int[] array)
{
DoMergeSort(array, 0, array.Length - 1);
}
}
}