It contains methods for both the iterative and recursive algorithm. The recursive is provided for reference only, use the iterative when possible.
As compared to QuickSortT, 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 MergeSort| MergeSort | Initializes a new instance of the MergeSort 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) |
| SortTT(IListTT) | Sort the entire list |
| SortTT(IListTT, IComparerTT) | Sort the entire list |
| SortTT(IListTT, ComparisonTT) | Sort the entire list |
| SortRecursiveTT(IListTT) | Sort the entire list, using recursive algorithm |
| SortRecursiveTT(IListTT, IComparerTT) | Sort the entire list, using recursive algorithm |
| SortRecursiveTT(IListTT, ComparisonTT) | Sort the entire list, using recursive algorithm |
| ToString | Returns a string that represents the current object. (Inherited from Object) |