[rouben@homenet rouben]$ ./unscramble
Enter scrambled word: slit
OK, trying to figure out what the heck "slit" is, hold on this may take a while...
slit
silt
list

#!/usr/bin/perl
# A really handy tool for solving those scrmbled word puzzles... couch potato
# style! Based on mjd_permute.

# The system dictionary file, full path please
$dictionary = "/usr/dict/words";
# The full path to the grep command (this may be optional, see below)
$grep = "/usr/local/bin/grep";
# Do you wanna use grep or an inefficient sequential search algorithm? ;)
# Too lazy to implement binary search... then again, I see no point with grep
# readily available to do the dirty work! ;)
$usegrep = 'yes';

print "Enter scrambled word: ";
my $word = <STDIN>;
# Get rid of the trailing newline...
chop($word);

print "OK, trying to figure out what the heck \"$word\" is, hold on this may take a while...\n";

    # Split the entered word into letters
    my @data = split(/ */, $word);

    my $num_permutations = factorial(scalar @data);
    for (my $i=0; $i < $num_permutations; $i++) { # Da magic for loop
        my @permutation = @data[n2perm($i, $#data)];
        $currentpermutation = join("",@permutation);

      # If we're not supposed to use grep...
      if (uc($usegrep) ne 'YES') {
        open(DICT, $dictionary);
          while (<DICT>) {
            $dictword = $_;
            chop($dictword);
            if ($dictword eq $currentpermutation) { print $currentpermutation."\n"; }
          }
        close(DICT);
      } else { # If we're supposed to use grep...
        # Make grep to the dirty work!!! Yeeeha!
        system($grep." ^".$currentpermutation." ".$dictionary);
      } # End of the if that decides whether we're supposed to use grep...
    } # ENd of da magic for loop
# Utility function: factorial with memoizing
BEGIN {
  my @fact = (1);
  sub factorial($) {
      my $n = shift;
      return $fact[$n] if defined $fact[$n];
      $fact[$n] = $n * factorial($n - 1);
  }
}

# n2pat($N, $len) : produce the $N-th pattern of length $len
sub n2pat {
    my $i   = 1;
    my $N   = shift;
    my $len = shift;
    my @pat;
    while ($i <= $len + 1) {   # Should really be just while ($N) { ...
        push @pat, $N % $i;
        $N = int($N/$i);
        $i++;
    }
    return @pat;
}

# pat2perm(@pat) : turn pattern returned by n2pat() into
# permutation of integers.  XXX: splice is already O(N)
sub pat2perm {
    my @pat    = @_;
    my @source = (0 .. $#pat);
    my @perm;
    push @perm, splice(@source, (pop @pat), 1) while @pat;
    return @perm;
}

# n2perm($N, $len) : generate the Nth permutation of $len objects
sub n2perm {
    pat2perm(n2pat(@_));
}

#!/usr/bin/perl
@a=(Lbzjoftt,Inqbujfodf,
Hvcsjt); $b="Lbssz Wbmm"
;$b =~ y/b-z/a-z/ ; $c =
" Tif ". @a ." hsfbu wj"
."suvft pg b qsphsbnnfs"
. ":\n";$c =~y/b-y/a-z/;
print"\n\n$c ";for($i=0;
$i<@a; $i++) { $a[$i] =~
y/b-y/a-z/;if($a[$i]eq$a
[-1]){print"and $a[$i]."
;}else{ print"$a[$i], ";
}}print"\n\t\t--$b\n\n";