Zero Factorial Returning 1 Recursively

bluechester

New Member
How can I get this recursive method to return \[code\]1\[/code\] on calling \[code\]0!\[/code\] without testing for a base case, that is without doing an \[code\]if-else\[/code\] for 0 and 1.\[code\]public static long f( number ){ if ( number <= 1 ){ // test for base case return 1; // base cases: 0! = 1 and 1! = 1 } else{ return number * f( number - 1 ); } }\[/code\]I don't want to check for base cases. Is this possible?
 
Top