Closest-pair problem: Difference between revisions
m
→{{header|Wren}}: Minor tidy
(added RPL) |
m (→{{header|Wren}}: Minor tidy) |
||
Line 5,100:
{{libheader|Wren-math}}
{{libheader|Wren-sort}}
<syntaxhighlight lang="
import "./sort" for Sort
var distance = Fn.new { |p1, p2| Math.hypot(p1[0] - p2[0], p1[1] - p2[1]) }
Line 5,194:
Closest pair (optimized) is [0.891663, 0.888594] and [0.925092, 0.81822], distance 0.077910191355175
</pre>
=={{header|XPL0}}==
The brute force method is simpler than the recursive solution
| |||