Package com.treemap

# Class PivotByAlgorithm.Biggest

java.lang.Object
com.treemap.PivotByAlgorithm.Biggest

All Implemented Interfaces:
  `PivotByAlgorithm.Type`

Enclosing class:
  `PivotByAlgorithm`

public static class PivotByAlgorithm.Biggest extends Object implements 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.

- ## Constructor Summary

  Constructors
  Constructor
  Description
  `Biggest()`

- ## Method Summary

  Modifier and Type
  Method
  Description
  `int`
  `computePivotIndex(TreeMapNode[] children)`
  Compute the pivot index
  `String`
  `toString()`

  ### Methods inherited from class java.lang.Object

  `clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait`

- ## Constructor Details

  - ### Biggest

    public Biggest()

- ## Method Details

  - ### computePivotIndex

    public int computePivotIndex(TreeMapNode[] children)
    Description copied from interface: `PivotByAlgorithm.Type`
    Compute the pivot index
    Specified by:
      `computePivotIndex` in interface `PivotByAlgorithm.Type`
    Parameters:
      `children` - the nodes
    Returns:
      the index of the node to use as a pivot

  - ### toString

    public String toString()
    Overrides:
      `toString` in class `Object`