As compared to MergeSortT, merge sort is stable (preserves order of equal elements), but uses more memory (an extra array of the same size). Quick sort is un-stable, but performs in-place sorting.
public class QuickSort<T>
| QuickSortT(IListT) | Creates an instance for sorting |
| QuickSortT(IListT, IComparerT) | Creates an instance for sorting |
| CompareCount | Number of compares during the sorting procedure |
| SwapCount | Number of swaps during the sorting procedure |
| Equals | Determines whether the specified object is equal to the current object. (Inherited from Object) |
| Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object) |
| GetHashCode | Serves as the default hash function. (Inherited from Object) |
| GetType | Gets the Type of the current instance. (Inherited from Object) |
| MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object) |
| Sort | Sort entire list |
| Sort(Int32, Int32) | Sort list within the provided indices (inclusive) |
| SortWpVersion |
Sort entire list.
Version from Wikipedia, which is not optimal |
| SortWpVersion(Int32, Int32) |
Sort list within the provided indices (inclusive)
Version from Wikipedia, which is not optimal |
| ToString | Returns a string that represents the current object. (Inherited from Object) |