Biggest
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.
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.