Sort Class 
Namespace: Accord
Name  Description  

InsertionT(T, Boolean) 
Insertion sort.
 
InsertionT(T, FuncT, T, Int32, Boolean) 
Insertion sort.
 
InsertionT(T, Int32, Int32, Boolean) 
Insertion sort.
 
InsertionT(T, Int32, Int32, FuncT, T, Int32, Boolean) 
Insertion sort.
 
InsertionT, U(T, U, Boolean) 
Insertion sort.
 
InsertionTKey, TValue(TKey, TValue, FuncTKey, TKey, Int32, Boolean) 
Insertion sort.
 
InsertionTKey, TValue(TKey, TValue, Int32, Int32, Boolean) 
Insertion sort.
 
InsertionTKeys, TValue(TKeys, TValue, Int32, Int32, FuncTKeys, TKeys, Int32, Boolean) 
Insertion sort.
 
NthElementT(T, Int32, Boolean) 
Retrieves the nth smallest element in an array. As a sideeffect, partially orders
the collection, making sure every element smaller than the nth smaller element are
in the beginning of the array.
 
NthElementT(T, Int32, Int32, Int32, Boolean) 
Retrieves the nth smallest element in an array. As a sideeffect, partially orders
the collection, making sure every element smaller than the nth smaller element are
in the beginning of the array.
 
NthElementT(T, Int32, Int32, Int32, FuncT, T, Int32, Boolean) 
Retrieves the nth smallest element in an array. As a sideeffect, partially orders
the collection, making sure every element smaller than the nth smaller element are
in the beginning of the array.
 
NthElementTKey, TValue(TKey, TValue, Int32, Int32, Int32, Boolean) 
Retrieves the nth smallest element in an array. As a sideeffect, partially orders
the collection, making sure every element smaller than the nth smaller element are
in the beginning of the array.
 
NthElementTKey, TValue(TKey, TValue, Int32, Int32, Int32, FuncTKey, TKey, Int32, Boolean) 
Retrieves the nth smallest element in an array. As a sideeffect, partially orders
the collection, making sure every element smaller than the nth smaller element are
in the beginning of the array.
 
PartitionT(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.
 
PartitionT(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.
 
PartitionTKey, 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.
 
PartitionTKey, 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.
