C# 内部的快速排序实现

private void QuickSort(int[] map, int left, int right)
{
    do
    {
        int index = left;
        int num2 = right;
        int num3 = map[index + ((num2 - index) >> 1)];
        do
        {
            while ((index < map.Length) && (this.CompareKeys(num3, map[index]) > 0))
            {
                index++;
            }
            while ((num2 >= 0) && (this.CompareKeys(num3, map[num2]) < 0))
            {
                num2--;
            }
            if (index > num2)
            {
                break;
            }
            if (index < num2)
            {
                int num4 = map[index];
                map[index] = map[num2];
                map[num2] = num4;
            }
            index++;
            num2--;
        }
        while (index <= num2);
        if ((num2 - left) <= (right - index))
        {
            if (left < num2)
            {
                this.QuickSort(map, left, num2);
            }
            left = index;
        }
        else
        {
            if (index < right)
            {
                this.QuickSort(map, index, right);
            }
            right = num2;
        }
    }
    while (left < right);
}

其中CompareKeys需要自己实现，也叫比较器，C#内部很多地方都要用到