This message was edited by IDK at 2005-3-29 11:30:35
The permutation function sould look like:
public int perm(int n)
{
if(n==1)
return 1;
else
return n*perm(n-1);
}
I have NOT compiled this but it should work
This is what they give as an example of a
recursive method.
El PROgrammador Niklas Ulvinge
(who doesn't know how to spell in inglish)