QuickSelect() [2/2]

override int System.Linq.EnumerableSorter< TElement, TKey >.QuickSelect ( int[] map, int right, int idx )

inlineprotected

Definition at line 179 of file EnumerableSorter.cs.

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

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