This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
From the practical point of view, log log N is a constant unless you have an Earth-size computer. So, what is the point? Gritzko (talk) 05:16, 9 February 2012 (UTC)
I'm confused - the article describes O(log_w n) as asymptotically faster than a traditional self balancing binary tree, but for a fixed w that's not true (since O(log_x n) is the same as O(log_y n)). — Preceding unsigned comment added by 22.214.171.124 (talk) 16:53, 16 August 2013 (UTC)