PartialQuickSort() [2/2]

override void System.Linq.EnumerableSorter< TElement, TKey >.PartialQuickSort ( int[] map, int left, int right, int minIdx, int maxIdx )

inlineprotected

Definition at line 116 of file EnumerableSorter.cs.

    {
        do
        {
            int num = left;
            int num2 = right;
            int index = map[num + (num2 - num >> 1)];
            while (true)
            {
                if (num < map.Length && CompareKeys(index, map[num]) > 0)
                {
                    num++;
                    continue;
                }
                while (num2 >= 0 && CompareKeys(index, map[num2]) < 0)
                {
                    num2--;
                }
                if (num > num2)
                {
                    break;
                }
                if (num < num2)
                {
                    int num3 = map[num];
                    map[num] = map[num2];
                    map[num2] = num3;
                }
                num++;
                num2--;
                if (num > num2)
                {
                    break;
                }
            }
            if (minIdx >= num)
            {
                left = num + 1;
            }
            else if (maxIdx <= num2)
            {
                right = num2 - 1;
            }
            if (num2 - left <= right - num)
            {
                if (left < num2)
                {
                    PartialQuickSort(map, left, num2, minIdx, maxIdx);
                }
                left = num;
            }
            else
            {
                if (num < right)
                {
                    PartialQuickSort(map, num, right, minIdx, maxIdx);
                }
                right = num2;
            }
        }
        while (left < right);
    }

References System.Linq.EnumerableSorter< TElement, TKey >.CompareKeys(), System.Linq.index, and System.Linq.EnumerableSorter< TElement, TKey >.PartialQuickSort().