The specification is simple: given a list of numbers, return the two which are nearest to one-another. Assume that the list contains at least two numbers, and the return order is irrelevent. Some foolhardy attempts of my own follow:
# 114 chars
sub nn1 {
my@p;my$d;for(0..$#_-1){for my$n ($_+1..$#_){my$e=abs$_[$_]-$_[$n];i
+f(!defined$d or$e<$d){$d=$e;@p=@_[$_,$n];}}}@p
}
# 100 chars
sub nn2 {
my@l=sort@_;$l[$_]=[@l[$_,$_+1]]for 0..$#l;pop@l;@{(sort{abs$$a[0]-$
+$a[1]<=>abs$$b[0]-$$b[1]}@l)[0]}
}
# 87 chars
sub nn3 {
@_=sort@_;my%d;$d{abs$_[$_]-$_[$_+1]}=[@_[$_,$_+1]]for 0..$#_-1;@{$d
+{(sort keys%d)[0]}}
}
Update: regarding the issue of duplicates, assume they are pairs like any other, so you would return duplicate numbers if they were present in the list.
MeowChow
s aamecha.s a..a\u$&owag.print
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.