Repository navigation
Expand file tree
/
Copy pathSort.cs
More file actions
97 lines (85 loc) · 2.33 KB
/
Copy pathSort.cs
File metadata and controls
97 lines (85 loc) · 2.33 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
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
using System;
namespace CompetitiveProgramming
{
public static partial class Sort
{
public static void MergeSort(int[] array, bool asc)
{
Divide(array, 0, array.Length - 1, asc);
}
private static void Divide(int[] array, int low, int high, bool asc)
{
if (low >= high)
{
return;
}
int mid = (low + high) / 2;
Divide(array, low, mid, asc);
Divide(array, mid + 1, high, asc);
Merge(array, low, mid, high, asc);
}
private static void Merge(int[] arry, int low, int mid, int high, bool asc)
{
int[] temp = new int[high - low + 1];
int left = low, right = mid + 1;
int k = -1;
while (left <= mid && right <= high)
{
if (asc)
{
if (arry[left] < arry[right])
{
temp[++k] = arry[left];
left++;
}
else
{
temp[++k] = arry[right];
right++;
}
}
else
{
if (arry[left] > arry[right])
{
temp[++k] = arry[left];
left++;
}
else
{
temp[++k] = arry[right];
right++;
}
}
}
if (left <= mid)
{
while (left <= mid)
{
temp[++k] = arry[left];
++left;
}
}
if (right <= high)
{
while (right <= high)
{
temp[++k] = arry[right];
++right;
}
}
k = -1;
for (int i = low; i <= high; i++)
{
arry[i] = temp[++k];
}
}
}
public static partial class Sort
{
public static void Hello()
{
var x = Array.ConvertAll("1 2 3 4".Split(' '), int.Parse );
}
}
}