Closed movatica closed 1 year ago
Instead of comparing the old and new trees to check if more aggregation is possible, simply count the number of aggregations that actually occured in the recent iteration. This reduces the break condition from O(k) to O(1).
Instead of comparing the old and new trees to check if more aggregation is possible, simply count the number of aggregations that actually occured in the recent iteration. This reduces the break condition from O(k) to O(1).