Package com.treemap
Class PivotByAlgorithm.Middle
java.lang.Object
com.treemap.PivotByAlgorithm.Middle
- All Implemented Interfaces:
PivotByAlgorithm.Type
- Enclosing class:
- PivotByAlgorithm
The pivot is taken to be the middle item of the list since this is more likely to create a balanced layout.
Complexity: O(n log n) 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
-
Middle
public Middle()
-
-
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
-