The following gives you a sorted list, so it should be easy to check against a sorted dictionary (by doing something like a merge sort). It's also memory efficient since it doesn't keep a list of all the permutations in memory.
use Algorithm::Loops qw( NextPermute );
my $word = 'tool';
my @list = sort ' ', $word =~ /(.)/g;
my $last_word = '';
while (NextPermute(@list)) {
my $new_word = join('', @list);
$new_word =~ s/ .*//;
next if ($new_word eq $last_word);
$last_word = $new_word;
print($new_word, $/);
}
Output:
l
lo
loo
loot
lot
loto
lt
lto
ltoo
o
ol
olo
olot
olt
olto
oo
ool
oolt
oot
ootl
ot
otl
otlo
oto
otol
t
tl
tlo
tloo
to
tol
tolo
too
tool
-
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.
|