K-d tree: Difference between revisions
m
Minor edit to C++ code
m (Minor edit to C++ code) |
|||
Line 321:
return nullptr;
size_t n = begin + (end - begin)/2;
std::nth_element(i + begin, i + n, i + end, node_cmp(index));
index = (index + 1) % dimensions;
nodes_[n].left_ = make_tree(begin, n, index);
| |||