Since people were really starting to take an interest in
the anagram problem posed at Is there a better way for finding anagrams?, why not golf
it?
The idea is to write a function which given a jumbled
word, will find any matching entries in a supplied
dictionary, and return an array of these qualifying matches.
The word, and dictionary, are only expected to
contain alphanumeric characters, although the dictionary
may contain some stray material such as the odd bit of
punctuation which can probably be ignored.
Here's my first pass that comes in just under three digits
at 98 characters:
sub a
{
sub z{join'',sort/./g}push(@{$d{&z}},$_)for(@{$_[1]});$w=z$_=$_[0];map
+{@{$d{$_}}}grep{/$w/i}keys%d
}
# Test Stub
open ($dict, "/usr/dict/words") || die "No words\n";
@dict = grep { chomp; } <$dict>;
close ($dict);
print a('geniretat',\@dict);
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|