Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re: Re: Re: (Golf) Nearest Neighbors

by satchboost (Scribe)
on Apr 05, 2001 at 00:23 UTC ( #69871=note: print w/ replies, xml ) Need Help??

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

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.

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

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (4)
As of 2015-10-04 20:18 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (104 votes), past polls