Click or drag to resize
Accord.NET (logo)

Sort Class

Extension methods for sorting operations.
Inheritance Hierarchy
SystemObject
  AccordSort

Namespace:  Accord
Assembly:  Accord.Math (in Accord.Math.dll) Version: 3.5.0
Syntax
public static class Sort
Request Example View Source
Methods
  NameDescription
Public methodStatic memberInsertionT(T, Boolean)
Insertion sort.
Public methodStatic memberInsertionT(T, FuncT, T, Int32, Boolean)
Insertion sort.
Public methodStatic memberInsertionT(T, Int32, Int32, Boolean)
Insertion sort.
Public methodStatic memberInsertionT(T, Int32, Int32, FuncT, T, Int32, Boolean)
Insertion sort.
Public methodStatic memberInsertionT, U(T, U, Boolean)
Insertion sort.
Public methodStatic memberInsertionTKey, TValue(TKey, TValue, FuncTKey, TKey, Int32, Boolean)
Insertion sort.
Public methodStatic memberInsertionTKey, TValue(TKey, TValue, Int32, Int32, Boolean)
Insertion sort.
Public methodStatic memberInsertionTKeys, TValue(TKeys, TValue, Int32, Int32, FuncTKeys, TKeys, Int32, Boolean)
Insertion sort.
Public methodStatic memberNthElementT(T, Int32, Boolean)
Retrieves the n-th smallest element in an array. As a side-effect, partially orders the collection, making sure every element smaller than the n-th smaller element are in the beginning of the array.
Public methodStatic memberNthElementT(T, Int32, Int32, Int32, Boolean)
Retrieves the n-th smallest element in an array. As a side-effect, partially orders the collection, making sure every element smaller than the n-th smaller element are in the beginning of the array.
Public methodStatic memberNthElementT(T, Int32, Int32, Int32, FuncT, T, Int32, Boolean)
Retrieves the n-th smallest element in an array. As a side-effect, partially orders the collection, making sure every element smaller than the n-th smaller element are in the beginning of the array.
Public methodStatic memberNthElementTKey, TValue(TKey, TValue, Int32, Int32, Int32, Boolean)
Retrieves the n-th smallest element in an array. As a side-effect, partially orders the collection, making sure every element smaller than the n-th smaller element are in the beginning of the array.
Public methodStatic memberNthElementTKey, TValue(TKey, TValue, Int32, Int32, Int32, FuncTKey, TKey, Int32, Boolean)
Retrieves the n-th smallest element in an array. As a side-effect, partially orders the collection, making sure every element smaller than the n-th smaller element are in the beginning of the array.
Public methodStatic memberPartitionT(T, Int32, Int32, Boolean)
Reorders the elements in the range [left, right) in such a way that all elements that are smaller than the pivot precede those that are greater than the pivot. Relative order of the elements is not preserved. This function should be equivalent to C++'s std::partition.
Public methodStatic memberPartitionT(T, Int32, Int32, FuncT, T, Int32, Boolean)
Reorders the elements in the range [left, right) in such a way that all elements for which the function compare returns true precede the elements for which compare returns false. Relative order of the elements is not preserved. This function should be equivalent to C++'s std::partition.
Public methodStatic memberPartitionTKey, TValue(TKey, TValue, Int32, Int32, Boolean)
Reorders the elements in the range [left, right) in such a way that all elements that are smaller than the pivot precede those that are greater than the pivot. Relative order of the elements is not preserved. This function should be equivalent to C++'s std::partition.
Public methodStatic memberPartitionTKey, TValue(TKey, TValue, Int32, Int32, FuncTKey, TKey, Int32, Boolean)
Reorders the elements in the range [left, right) in such a way that all elements for which the function compare returns true precede the elements for which compare returns false. Relative order of the elements is not preserved. This function should be equivalent to C++'s std::partition.
Top
See Also