CircularListTSort(Int32, Int32, IComparerT) Method

public void Sort(
	int index,
	int count,
	IComparer<T>? comparer
)

Public Sub Sort ( 
	index As Integer,
	count As Integer,
	comparer As IComparer(Of T)
)

public:
void Sort(
	int index, 
	int count, 
	IComparer<T>^ comparer
)

member Sort : 
        index : int * 
        count : int * 
        comparer : IComparer<'T> -> unit 

Parameters

index  Int32

The zero-based starting index of the range to sort.

count  Int32

The length of the range to sort.

comparer  IComparerT

The IComparerT implementation to use when comparing elements, or to use the default comparer Default.

If comparer is , then if T is an enum, this method uses the EnumComparer<TEnum>.Comparer; otherwise, the default comparer Comparer<T>.Default checks whether type T implements the IComparableT generic interface and uses that implementation, if available. If not, Comparer<T>.Default checks whether type T implements the IComparable interface. If type T does not implement either interface, Comparer<T>.Default throws an InvalidOperationException.

This implementation performs an unstable sort; that is, if two elements are equal, their order might not be preserved. In contrast, a stable sort preserves the order of elements that are equal.

On average, this method is an O(n log n) operation, where n is Count; in the worst case it is an O(n ^ 2) operation.

Reference