# SplitSize

class SplitSize : PivotByAlgorithm.Type

Selects the pivot that will split L1 and L3 into approximately equal total areas.

Complexity: O(n log n) average, O(n^2) worst case, where n is the number of nodes in the tree.

## Constructors

SplitSize
Link copied to clipboard
constructor()

## Functions

computePivotIndex
Link copied to clipboard
open override fun <N> computePivotIndex(children: Array<N>, accessor: TreeMapAccessor<N>): Int

Compute the pivot index

toString
Link copied to clipboard
open override fun toString(): String