K-d tree: Difference between revisions

Content added Content deleted
m (J)
Line 961:
The kdtree implementation is almost five times slower than the brute force implementation for this small dataset. How about the bigger dataset?
 
<lang J> tree=:conew&''kdtree'' dataset
timespacex 'nearest__tree pnt'
0.0134688 54272
Retrieved from "https://rosettacode.org/wiki/K-d_tree"