The Asprosys.Sorting namespace contains interfaces and classes used to sort arrays and lists using a number of the most useful sorting algorithms.
Classes
| Class | Description | |
|---|---|---|
 | Heapsort |
Provides static methods for sorting arrays and lists using a binary Heapsort algorithm.
|
| InsertionSort |
Provides static methods for sorting arrays and lists using a an Insertion Sort algorithm.
|
| Introsort |
Provides static methods for sorting arrays and lists using the Introsort algorithm. A combination of a
multi-threaded Quicksort with a final Heapsort pass if necessary.
|
| Mergesort |
Provides static methods for sorting arrays and lists using a multi-threaded Mergesort algorithm.
|
| Quicksort |
Provides static methods for sorting arrays and lists using a multi-threaded Quicksort algorithm.
|
Interfaces
| Interface | Description | |
|---|---|---|
 | IUnsafeComparer |
Exposes methods that compare, swap and assign objects using pointers to their instances.
|
