Click or drag to resize

CollectionUtilityMergeSortUnmanaged Method

Overload List
  NameDescription
Public methodStatic memberMergeSortUnmanagedT(T, IComparerT, Boolean)
Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort.
Public methodStatic memberMergeSortUnmanagedT(T, ComparisonT, Boolean)
Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort.
Public methodStatic memberMergeSortUnmanagedT(T*, Int32, PointerComparisonT, Boolean)
Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort.
Public methodStatic memberMergeSortUnmanagedT(T*, Int32, IComparerT, Boolean)
Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort.
Public methodStatic memberMergeSortUnmanagedT(T*, Int32, ComparisonT, Boolean)
Merge sort is a efficient sorting method. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Stable sort.
Top
See Also