GenericExtensionsSort Method |
Overload List| Name | Description | |
|---|---|---|
  | SortT(IListT) |
Sorts the elements in the entire List{T} using the default comparer.
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). |
| Sort(IXYTable) |
Sort table by x-value, using a quick-sort algorithm
|
| SortT(IListT, IComparerT) |
Sorts the elements in the entire List{T} using the provided comparer.
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). |
See Also