recursion
int function(int value) {
if(value < 1)
return;
function(value - 1);
printf("%d ",value);
}recursion
int function(int value) {
if(value < 1)
return;
function(value - 1);
printf("%d ",value);
}what is recursion
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
function loop(x) {
if (x >= 10) // "x >= 10" is the exit condition (equivalent to "!(x < 10)")
return;
// do stuff
loop(x + 1); // the recursive call
}
loop(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
