Talk:Fusion tree
![]() | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
|
Untitled
[edit]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 38.105.200.253 (talk) 16:53, 16 August 2013 (UTC)
India Education Program course assignment
[edit] This article was the subject of an educational assignment at College Of Engineering Pune supported by Wikipedia Ambassadors through the India Education Program during the 2011 Q3 term. Further details are available on the course page.
The above message was substituted from {{IEP assignment}}
by PrimeBOT (talk) on 20:09, 1 February 2023 (UTC)