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 abstract class QuickSort| QuickSort | Initializes a new instance of the QuickSort class |
| 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) |
| SortT(IListT) | Sort the entire list |
| SortT(IListT, IComparerT) | Sort the entire list |
| ToString | Returns a string that represents the current object. (Inherited from Object) |