Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Re: (Golf) Nearest Neighbors

by MeowChow (Vicar)
on Apr 04, 2001 at 23:45 UTC ( #69846=note: print w/ replies, xml ) Need Help??


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

Very nice! Sniping one character gives:

sub nn { @_=sort{$a<=>$b}@_; $_[1]-$_[0]>$_[$_]-$_[$_-1]and@_[0,1]=@_[$_,$_-1]for 2..$#_; @_[0,1] }
The number to beat is 86...
   MeowChow                                   
               s aamecha.s a..a\u$&owag.print


Comment on Re: Re: (Golf) Nearest Neighbors
Download Code
Re: Re: Re: (Golf) Nearest Neighbors
by satchboost (Scribe) on Apr 05, 2001 at 00:23 UTC
    This doesn't deal with duplicates. If you want to deal with duplicates, I think you change it to:
    sub nn { @_{@_}=0;@_=sort{$a<=>$b}keys%_; $_[1]-$_[0]>$_[$_]-$_[$_-1]and@_[0,1]=@_[$_,$_-1]for 2..$#_; @_[0,1] }

    That brings the total from 86 to 99. I'm not sure if the spec requires that duplicates be treated as one element or separate elements.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (3)
As of 2015-07-03 22:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (57 votes), past polls