GenericExtensionsSortT Method (IListT, IComparerT) |
A quick sort algorithm is used. Quick sort is a un-stable sort algorithm i.e. if two elements are equal their order may not be preserved.
If the provided IList is either an array or a list, the build in sorting method is used (also quick sort).
Namespace: DHI.Mike1D.Generic
public static void Sort<T>( this IList<T> list, IComparer<T> comparer )