Package com.treemap
Class PivotByAlgorithm.Biggest
java.lang.Object
com.treemap.PivotByAlgorithm.Biggest
- All Implemented Interfaces:
PivotByAlgorithm.Type
- Enclosing class:
- PivotByAlgorithm
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 -
Method Summary
Modifier and TypeMethodDescriptionint
computePivotIndex
(TreeMapNode[] children) Compute the pivot indextoString()
-
Constructor Details
-
Biggest
public Biggest()
-
-
Method Details
-
computePivotIndex
Description copied from interface:PivotByAlgorithm.Type
Compute the pivot index- Specified by:
computePivotIndex
in interfacePivotByAlgorithm.Type
- Parameters:
children
- the nodes- Returns:
- the index of the node to use as a pivot
-
toString
-