Anonymous user
Talk:K-d tree: Difference between revisions
→Dubious about speed claims here
Line 82:
: Fortunately, most people don't understand efficiency? --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 08:14, 6 June 2014 (UTC)
:: You could say the same thing about any search tree if all you need is find one node. Search-trees are for repeated lookups, where tree construction is amortized. Once constructed, search complexity is the tree height which should be <math>O(log(N))</math> if the tree is reasonably full. Compare that to the sequential search's <math>O(N)</math>, the implication should be clear. --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 17:16, 6 June 2014 (UTC)
| |||