Can somebody explain the recursive functions with details?

Question

I red it's definition but didn't understand

Answer 1

look recursive function is a function, which calls himself until the condition is true. For example:
int name(int num) {
if (num == 1)
return 1;
return num+name(num-1);
}

if we pass lets say 3 to it, it will return 3+2+1

Answer 2

Hey brother check this.you can understand how recursion works.

https://www.sololearn.com/discuss/1149517/?ref=app

Answer 3

Great question Otabek Karimov

Answer 4

Recursion is where a method calls itself. this is useful where you may want to loop recursively vs looping iteratively (like standard for loop)

int factorial(int num)
{
if(num == 1)
return 1;

return factorial(num - 1) * num;
}

This example recursively finds the factorial of "num"

Answer 5

yea I see that now

Answer 6

Thank you for explaining

Answer 7

Recursive function simply known as repeated function.
It's used for repeated function execution in program.
Example factorial numbe.
It's calls the function when condition is true another way return the value.

Answer 8

That's funny that we had the same idea, I didn't see the post until after I posted mine haha

Answer 9

John yea ) the most common case to learn is factorial, I’ve tried to explain a bit easier )

Answer 10

my example is not computing factorial ))