Merge sort implementation. Uses insertion if the number of elements to sort is low.
Declaration Syntax
public static void MergeSort<T>(
T[] src,
T[] dest,
int low,
int high,
int offset,
IComparer<T> comp
)
Generic Template Parameters
Parameters
-
src (array<T>[]()[][])
- The source array
-
dest (array<T>[]()[][])
- The destination array that contains the sorted elements.
-
low (Int32)
- The lower bound.
-
high (Int32)
- The upper bound
-
offset (Int32)
- The offset from the start of the arrays
-
comp (IComparer<(Of <(<'T>)>)>)
- The comparator to use
Assembly:
Tesla (Module: Tesla) Version: 0.5.0.0 (0.5.0.0)