Domanda di colloquio di Goldman Sachs
Recursive calculate n! Write down code
Risposte di colloquio
Anonimo
2 ott 2011
int factorial(int n) { if(n==0) // calculates zero factorial which is equal to 1 return 1; else return n*fact(n-1); }
2
Recursive calculate n! Write down code
Anonimo
int factorial(int n) { if(n==0) // calculates zero factorial which is equal to 1 return 1; else return n*fact(n-1); }