An algorithm for generating permutations of a PHP redemption

An algorithm for generating permutations of a PHP implementation

 $v) {$tmp = $index;        Unset ($tmp [$i]);            Remove the current prefix/* Debug information for easy comprehension of echo "Len $n, cur $i, index:\n";             Var_dump ($TMP);   */$ret = perm ($s, $n-1, $tmp);                       Recursion gets a slightly shorter arrangement if ($ret! = ") {foreach ($ret as $r) { $res [] = $s [$v].   $r;            Spell the shorter arrangement one by one with the current prefix}} or else {$res [] = $s [$v];    }} return $res;    }}function Getperm ($s) {$n = strlen ($s);    $index = Range (0, $n-1);    Get permutations of different lengths for ($i =1; $i <= $n; $i + +) {Var_dump (perm ($s, $i, $index)); }}getperm (' ABCD ');? >

