# Biggest

class Biggest : PivotByAlgorithm.Type

The pivot is taken to be the item with the largest area since the largest item is the most difficult to place.

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

## Constructors

Biggest
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