Talk:Ball tree

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.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

time complexity[edit]

What is "time complexity $O(n\,lg\,n)$ ?" Is it $O(n\log n)$ ? Kkddkkdd (talk) 15:29, 22 April 2015 (UTC)[reply]

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 $log_{2}$ is used, ie, simliar to typical kd-tree implementastiions: anyone who have read library-soruce-codes validating latter assumption? — Preceding unsigned comment added by 82.164.65.143 (talk) 22:54, 17 May 2017 (UTC)[reply]

Asymptotically, all logarithms are the same. The base is just a constant factor that is ignored by theoretical complexity analysis (although constant factors make a big difference in reality, as our data is finite). 77.177.132.161 (talk) —Preceding undated comment added 11:08, 10 December 2017 (UTC)[reply]