IntroSort()

void System.Array.SorterGenericArray.IntroSort ( int lo, int hi, int depthLimit )

inlineprivate

Definition at line 296 of file Array.cs.

        {
            while (hi > lo)
            {
                int num = hi - lo + 1;
                if (num <= 16)
                {
                    switch (num)
                    {
                    case 2:
                        SwapIfGreater(lo, hi);
                        break;
                    case 3:
                        SwapIfGreater(lo, hi - 1);
                        SwapIfGreater(lo, hi);
                        SwapIfGreater(hi - 1, hi);
                        break;
                    default:
                        InsertionSort(lo, hi);
                        break;
                    }
                    break;
                }
                if (depthLimit == 0)
                {
                    Heapsort(lo, hi);
                    break;
                }
                depthLimit--;
                int num2 = PickPivotAndPartition(lo, hi);
                IntroSort(num2 + 1, hi, depthLimit);
                hi = num2 - 1;
            }
        }

References System.Array.SorterGenericArray.Heapsort(), System.Array.SorterGenericArray.InsertionSort(), System.Array.SorterGenericArray.IntroSort(), System.Array.SorterGenericArray.PickPivotAndPartition(), and System.Array.SorterGenericArray.SwapIfGreater().

Referenced by System.Array.SorterGenericArray.IntroSort(), and System.Array.SorterGenericArray.IntrospectiveSort().