Talk:Ball tree

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computer science (Rated Stub-class, Low-importance)
WikiProject icon 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.
Stub-Class article Stub  This article has been rated as Stub-Class on the project's quality scale.
 Low  This article has been rated as Low-importance on the project's importance scale.

time complexity[edit]

What is "time complexity ?" Is it ? Kkddkkdd (talk) 15:29, 22 April 2015 (UTC)

Qeustion(1) wrt. above: why should there be an interpreation-difference wrt. "lg(..)" vs "log(..)", ie, as both are used (among others in Copmtuer-science) to abbreviate the "logarithm(..)" term? (oekseth)

Qeustion(2): First impression is that is used, ie, simliar to typical kd-tree implementastiions: anyone who have read library-soruce-codes validating latter assumption? — Preceding unsigned comment added by (talk) 22:54, 17 May 2017 (UTC)