Closest-pair problem: Difference between revisions
m
→{{header|Perl}}: revised comment regarding timings
SqrtNegInf (talk | contribs) m (→{{header|Perl}}: revised comment regarding timings) |
|||
Line 2,794:
=={{header|Perl}}==
The divide & conquer technique is about 100x faster than the brute-force algorithm.
<lang perl>#! /usr/bin/perl
use strict;
Line 2,900 ⟶ 2,901:
my ($a1, $b1, $d1) = closest_pair(\@points);
=={{header|Perl 6}}==
| |||