java recursion
public static long factorial(int n) {
if (n == 1) return 1; //base case
return n * factorial(n-1);
}java recursion
public static long factorial(int n) {
if (n == 1) return 1; //base case
return n * factorial(n-1);
}Recursion examples Java
public static void countDown(int number){
if (number == 0) {
System.out.println(number);
} else {
System.out.println(number);
countDown(number - 1);
}
}recursion java
public static int exponent(int n){
int ans;
if(n == 0)
return 1;
else if(n%2 == 0){
int k = exponent(n/2);
ans = k*k;
}
ans= 2 * exponent(n-1);
return ans ;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
