SortingHeap |
Overload List| Name | Description | |
|---|---|---|
  | HeapSortVirtuallyT(IListT) | 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. |
| HeapSortVirtuallyT(IListT, Int32) | 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. |
See Also