Algorithms..::..StableSort Method
Overload List
| Name | Description | |
|---|---|---|
|
StableSort<(Of <<'(T>)>>)(IEnumerable<(Of <<'(T>)>>)) |
Creates a sorted version of a collection. The sort is stable, which means that if items X and Y are equal,
and X precedes Y in the unsorted collection, X will precede Y is the sorted collection.
|
|
|
StableSort<(Of <<'(T>)>>)(IEnumerable<(Of <<'(T>)>>), IComparer<(Of <<'(T>)>>)) |
Creates a sorted version of a collection. The sort is stable, which means that if items X and Y are equal,
and X precedes Y in the unsorted collection, X will precede Y is the sorted collection. A supplied IComparer<T> is used
to compare the items in the collection.
|
|
|
StableSort<(Of <<'(T>)>>)(IEnumerable<(Of <<'(T>)>>), Comparison<(Of <<'(T>)>>)) |
Creates a sorted version of a collection. The sort is stable, which means that if items X and Y are equal,
and X precedes Y in the unsorted collection, X will precede Y is the sorted collection.
A supplied Comparison<T> delegate is used
to compare the items in the collection.
|