Don't fret -- an equally speedy solution is thus:

sub shuffle (\@) {
  my $d = shift;
  my @r = map rand, 0 .. $#$d;
  @$d[sort { $r[$a] <=> $r[$b] } 0 .. $#$d] = @$d;
}
[download]

It requires you send it an actual array, of course, but it is just as fast.

_____________________________________________________
Jeff[japhy]Pinyan: Perl, regex, and perl hacker, who'd like a job (NYC-area)
s++=END;++y(;-P)}y js++=;shajsj<++y(p-q)}?print:??;