Click or drag to resize

QuickSort Class

Class performing quicksort of an IListT

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.

Inheritance Hierarchy
SystemObject
  DHI.Mike1D.GenericQuickSort

Namespace:  DHI.Mike1D.Generic
Assembly:  DHI.Mike1D.Generic (in DHI.Mike1D.Generic.dll) Version: 16.0.0.0 (11.1.1.1111)
Syntax
C#
Copy
public abstract class QuickSort

The QuickSort type exposes the following members.

Constructors
  NameDescription
Protected methodQuickSort
Initializes a new instance of the QuickSort class
Top
Methods
  NameDescription
Public methodEquals
Determines whether the specified object is equal to the current object.
(Inherited from Object.)
Protected methodFinalize
Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.
(Inherited from Object.)
Public methodGetHashCode
Serves as a hash function for a particular type.
(Inherited from Object.)
Public methodGetType
Gets the Type of the current instance.
(Inherited from Object.)
Protected methodMemberwiseClone
Creates a shallow copy of the current Object.
(Inherited from Object.)
Public methodStatic memberSortT(IListT)
Sort the entire list
Public methodStatic memberSortT(IListT, IComparerT)
Sort the entire list
Public methodToString
Returns a string that represents the current object.
(Inherited from Object.)
Top
See Also