Figure 9From: A practical O(n log2 n) time algorithm for computing the triplet distance on binary treesComparison to O ( n2) algorithm. Ratio between the running times for the O(n2) time algorithm and the O(n log2 n) time algorithm.Back to article page