private static void IntrospectiveSort(T[] keys, int left, int length) { if (length < 2) { return; } IntroSort(keys, left, length + left - 1, 2 * ArraySorterHelper.FloorLog2(keys.Length)); }
internal static void IntrospectiveSort <T, TComparer>(T[] keys, int indexFrom, int indexTo, TComparer comparer) where T : struct where TComparer : ICopyFreeComparer <T> { int length = indexTo - indexFrom + 1; if (length < 2) { return; } IntroSort(keys, indexFrom, indexTo, 2 * ArraySorterHelper.FloorLog2(length), comparer); }