Click or drag to resize

SortingHeapSortVirtuallyT(IListT, Int32) Method

Sorts the elements, but maintains the original order in the provided array. Instead, an array of indices is created. The elements are sorted in the sense that elementsToSort[indexArray[i]] is sorted afterwards. The standard comparer of the elements is used for comparison.

Namespace: Altaxo.Data
Assembly: AltaxoBase (in AltaxoBase.dll) Version: 4.8.3179.0 (4.8.3179.0)
Syntax
C#
Copy
public static int[] HeapSortVirtually<T>(
	IList<T> elementsToSort,
	int[]? destinationIndexArray
)
where T : IComparable

Parameters

elementsToSort  IListT
The list of elements to sort. The list is not changed, thus it can be readonly.
destinationIndexArray  Int32
Can be null. If you provide an array here with a length greater or equal to the number of elements to sort, that array is used as return value and filled with the indices.

Type Parameters

T

[Missing <typeparam name="T"/> documentation for "M:Altaxo.Data.Sorting.HeapSortVirtually``1(System.Collections.Generic.IList{``0},System.Int32[])"]

Return Value

Int32
An array of indices, so that elementsToSort[indexArray[i]] (i = 0..Count-1) is sorted.
See Also