Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: (Golf) Nearest Neighbors

by danger (Priest)
on Apr 04, 2001 at 14:42 UTC ( #69611=note: print w/ replies, xml ) Need Help??

in reply to (Golf) Nearest Neighbors

As Tortue points out, all the ones using lexigraphic sorting fail on some sets of numbers. Stripping leading spaces and newlines, my stab weighs in at 87 characters:

sub nn { @_=sort{$a<=>$b}@_; $_[1]-$_[0]>$_[$_+1]-$_[$_]and@_[0,1]=@_[$_,$_+1]for 1..@_-2; @_[0,1] }
Comment on Re: (Golf) Nearest Neighbors
Download Code
Replies are listed 'Best First'.
Re: Re: (Golf) Nearest Neighbors
by MeowChow (Vicar) on Apr 04, 2001 at 23:45 UTC
    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...
                   s aamecha.s a..a\u$&owag.print
      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?

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (3)
As of 2016-05-24 22:59 GMT
Find Nodes?
    Voting Booth?