What is recursion function?

Answer 1

here if n is 3 for example it will decrease to 2 then to 1 , so when it reaches 1 it returns 3×2×1.(n*factorial(n-1)) bcz it knows what to return when n=1 .

Answer 2

a recursion function is a function that repeats its self unless it finds a value to stop on and u declare this value ex :
#include<stdio.h>
unsigned factorial (int n)
{ if (n==0 || n==1)
return 1 ;
else
return n*(factorial(n-1) );
}
void main ()
{ int n ;
printf("enter a number");
scanf ("%d", &n);
printf ("answer : %d!= %u ",n,factorial(n));
}

Answer 3

https://www.sololearn.com/discuss/943945/?ref=app
https://www.sololearn.com/discuss/307407/?ref=app
https://www.sololearn.com/discuss/942978/?ref=app

Answer 4

in simple terms its just a function calling itself repeatedly

Answer 5

This is a function that looks like a loop, but the exit condition of the function always lies in the function. Sample:

#include <iostream>
int rec(int i){
if(i>10)
return i;
i++;
rec(i);
}

int main(){
int i=0;
std::cout<<rec(i);
}

output: 11

for better understanding, you need to remember the theory of the graph.

Answer 6

A function that is called by itself😊