public static int Fact(int n) {
if(n==1) {
return 1;
}
int fnm1=Fact(n-1);
int fn=n*fnm1;
return fn;
}
the above code is not work for n=0
can we write the belo code fo factorial
public static int Fact1(int n) {
if(n==0) {
return 1;
}
return(n*Fact1(n-1));