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
|
#strict 2
global func SortNumeric(int a, int b)
{
if(a < b)
{
return -1;
}
else if(a > b)
{
return 1;
}
}
global func SortNumericInverse(int a, int b)
{
return -SortNumeric(a, b);
}
global func QSort(array& data, callback) // WARNING: Can cause stack-overflow with too much data
{
if(callback == true)
{
callback = GlobalCallback("SortNumericInverse");
}
QSort_Part(data, callback || GlobalCallback("SortNumeric"), 0, GetLength(data) - 1);
return data;
}
global func QSort_Part(array& data, callback, int left, int right)
{
if(left < right)
{
// Partitioning
var pPos = RandomX(left, right);
var p = data[pPos];
var tmp;
tmp = data[pPos];
data[pPos] = data[right];
data[right] = tmp;
pPos = right;
var i = left - 1;
for(var j = left; j <= right; ++j)
{
if(Call(callback, data[j], p) < 0)
{
++i;
tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
++i;
tmp = data[i];
data[i] = data[pPos];
data[pPos] = tmp;
// -----
QSort_Part(data, callback, left, i - 1);
QSort_Part(data, callback, i + 1, right);
}
}
|
