SortPartitionT Method (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.

Namespace: Accord
Assembly: Accord.Math (in Accord.Math.dll) Version: 3.8.0

Syntax

Copy

public static int Partition<T>(
	this T[] items,
	int first,
	int last,
	Func<T, T, int> compare,
	bool asc = true
)

<ExtensionAttribute>
Public Shared Function Partition(Of T) ( 
	items As T(),
	first As Integer,
	last As Integer,
	compare As Func(Of T, T, Integer),
	Optional asc As Boolean = true
) As Integer

Request Example View Source

Parameters

items: 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.
compare: Type: SystemFuncT, T, Int32
Function to use in the comparison.
asc (Optional): Type: SystemBoolean
Whether to sort in ascending or descending order.

Type Parameters

T

Return Value

Type: Int32
The 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).

Reference

Sort Class

Partition Overload

Accord Namespace