|
SortPartitionT Method (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.
Namespace:
Accord
Assembly:
Accord.Math (in Accord.Math.dll) Version: 3.8.0
Syntax public static int Partition<T>(
this T[] keys,
int first,
int last,
bool asc = true
)
where T : Object, IComparable<T>
<ExtensionAttribute>
Public Shared Function Partition(Of T As {Object, IComparable(Of T)}) (
keys As T(),
first As Integer,
last As Integer,
Optional asc As Boolean = true
) As Integer
Request Example
View SourceParameters
- keys
- Type: T
The list to be reordered. - first
- Type: SystemInt32
The beginning of the range to be reordered. - last
- Type: SystemInt32
The end of the range to be reordered. - asc (Optional)
- Type: SystemBoolean
Whether to sort in ascending or descending order.
Type Parameters
- T
Return Value
Type:
Int32The index of the new pivot.
Usage Note
In Visual Basic and C#, you can call this method as an instance method on any object of type . When you use instance method syntax to call this method, omit the first parameter. For more information, see
Extension Methods (Visual Basic) or
Extension Methods (C# Programming Guide).
See Also