Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Closest-value-in-list Golf!

by chipmunk (Parson)
on May 29, 2001 at 20:26 UTC ( #83991=note: print w/ replies, xml ) Need Help??

in reply to Closest-value-in-list Golf!

I disagree with tilly that using sort() is the natural solution. I think this is the natural solution:

sub closest { $n=pop;$c=pop;abs$n-$_<abs$n-$c?$c=$_:0for@_;$c }
This is O(n) rather than O(n*log n). Of course, at 47 characters it is, unfortunately, a longer solution. Oh well!

Comment on Re: Closest-value-in-list Golf!
Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (7)
As of 2015-07-29 04:13 GMT
Find Nodes?
    Voting Booth?

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

    Results (260 votes), past polls