Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

Re: Re (tilly) 1: (Golf) Nearest Neighbors

by jmcnamara (Monsignor)
on Apr 05, 2001 at 16:36 UTC ( #70062=note: print w/ replies, xml ) Need Help??

in reply to Re (tilly) 1: (Golf) Nearest Neighbors
in thread (Golf) Nearest Neighbors

Excellent solution. The interesting thing about Perl Golf is how different people tackle problems in terms of their favourite tools; map, sort, regex, grep, closures, slices or whatever.

Just for fun I ran your solutions through Perltidy as a test case. Here is the output:

sub nn { my @x = @_[0, 1]; @_ = sort { abs $x[0] - $x[1] < abs $a - $b or @x = ($a, $b); $a <=> $b; } @_; @x } sub nn { () = sort { abs $_[0] - $_[1] < abs $a - $b or @_ = ($a, $b); $a <=> $b; } @_; @_ }

Comment on Re: Re (tilly) 1: (Golf) Nearest Neighbors
Download Code

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://70062]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (6)
As of 2015-11-30 00:17 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (754 votes), past polls