Unity3D -- 快速排序

void QSort(Transform[] a,int low,int high)
{
if (low >= high) {
return;
}
int first = low;
int last = high;
Transform key = a [first];
while (first < last) {
while (first < last && NameToInt (a [last]) >= NameToInt(key)) {
--last;
}
a [first] = a [last];
while (first < last && NameToInt (a [first]) <= NameToInt(key)) {
++first;
}
a [last] = a [first];
}
a [first] = key;
QSort (a, low, first - 1);
QSort (a, first + 1, high);
}

int NameToInt(Transform t)
{
string[] str = t.name.Split ('_');
return int.Parse(str[1]);
}