K-d tree: Difference between revisions
m
→{{header|Sidef}}: updated code
m (→{{header|Sidef}}: updated code) |
|||
Line 1,921:
func show_nearest(k, heading, kd, p) {
print <<
#{heading}:
Point: [#{p.join(',')}]
END
var n = find_nearest(k, kd, p);
print <<
Nearest neighbor: [#{n.nearest.join(',')}]
Distance: #{sqrt(n.dist_sqd)}
|