InsertionSort()

void System.Array.SorterObjectArray.InsertionSort ( int lo, int hi )

inlineprivate

Definition at line 201 of file Array.cs.

        {
            for (int i = lo; i < hi; i++)
            {
                int num = i;
                object obj = keys[i + 1];
                object[] array = items;
                object obj2 = ((array != null) ? array[i + 1] : null);
                while (num >= lo && comparer.Compare(obj, keys[num]) < 0)
                {
                    keys[num + 1] = keys[num];
                    if (items != null)
                    {
                        items[num + 1] = items[num];
                    }
                    num--;
                }
                keys[num + 1] = obj;
                if (items != null)
                {
                    items[num + 1] = obj2;
                }
            }
        }

References System.array, System.Collections.Generic.IComparer< in T >.Compare(), System.Array.SorterObjectArray.comparer, System.Array.SorterObjectArray.items, System.Array.SorterObjectArray.keys, and System.obj.

Referenced by System.Array.SorterObjectArray.IntroSort().