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 in java
class scratch{
public static long factorial(int n){
if ( n == 1 ){
return 1;
}
else{
return n * factorial( n - 1 );
}
}
public static void main(String[] args) {
System.out.println( factorial(5) );
//Print 120 (5!) to the console
}
}java recursion
// prints x number of $
public static void recursion(int x) {
if(x == 0) { // base case
System.out.println();
} else { // recursive case
System.out.print("$");
recursion(x - 1);
}
}recursion in java
Recursion is a basic programming technique
you can use in Java, in which a method
calls itself to solve some problem.
A method that uses this technique
is recursive. Many programming problems
can be solved only by recursion,
and some problems that can be solved by
other techniques are better solved by recursion.
EXP-1: Factorial
public static long factorial(int n){
if (n == 1)
return 1;
else
return n * factorial(n-1);
}
EXP-2: Fibonacci
static int n1=1, n2=2, n3=0;
public static void printFibo(int count){
if (count > 0) {
n3 = n1 + n2;
n1 = n2;
n2 = n3;
System.out.print(" " + n3);
printFibo(count-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 ;
}recursion java
public class Main {
public static void main(String[] args) {
int result = sum(10);
System.out.println(result);
}
public static int sum(int k) {
if (k > 0) {
return k + sum(k - 1);
} else {
return 0;
}
}
}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
