Why are we use RECURSION in programing?

Question

I'm now solving some problem related to recursion.

Answer 1

A 'recursive' function is a function that calls itself, either directly or indirectly.
Recursion is a powerful technique in which a problem is divided into a set of similar subproblems, each solved with a trivial solution.

**Generally, a recursive function calls itself to solve its subproblems.

Answer 2

For some problems, a recursive solution is more 'natural' and succinct.

Answer 3

Shail Murtaza in recursion you call the same function and not a parent function.

Answer 4

Meher Ali OK. Factorials and Fibonacci sequences are examples.

Answer 5

Recursion is used to call a function itself again and again
But you can do same thing by loops and recursion is not good practice because if you recure your function many times at some point it absolutely will give you error because of memory issue

Answer 6

Keshav Kumar some problems are better solved iteratively and some solved better recursively.

Answer 7

https://www.educative.io/courses/recursion-for-coding-interviews-in-cpp/qAx1lwQYDNG

Have a look

Answer 8

To understand better how a fonction can call itself or other inner function for infinite or limited time.This can cause great problem in c coding and crash the program or may be the entire system you code in.It is so dangerous to deal with function in c and require more attention.

Answer 9

The classic example is the Fibonacci series 0 1 1 2 3 5 8 13....
Term n+1= Term n + Term n-1 where n>=1....
The first two terms are hard coded...
🔁 Recursion is the key 🗝 here 🤔

Answer 10

for sorting techniques recursion is very helpful

Answer 11

For reparation of a function without using any loop

Answer 12

Recursion is the process of repeating items in a self-similar way. In programming languages, if a program allows you to call a function inside the same function, then it is called a recursive call of the function.

Check out this link...
https://www.tutorialspoint.com/cprogramming/c_recursion.htm#:~:text=Recursion%20is%20the%20process%20of,int%20main()%20%7B%20recursion()%3B%20%7D

Answer 13

Danijel Ivanović i think iterative approach is better

Answer 14

For example if you want to Silvester
5!
int x;
scanf("%d",&x);
for(i=x;i>1;i--){
x=x*i;
}

Answer 15

A recursive algorithm - a method calling by itself - allows an elegant solution for a problem with often an easier way.

Answer 16

Sonic dude, I wll practice more and more with recursion.
Thank you so much

Answer 17

recursion is method of solving the problem where the solution depends on smaller instances of the the same solution.the power of recursion shows the possibility of defining infinite set of objects by a finite statement

Answer 18

For me, you should use recursion when there are multiple path(or choices) are there in you problem statement and it would be ambiguous to solve it iteratively.

Answer 19

Erialdo Meta 🇦🇱 i asked this question because I think, if we use RECURSION then memory consumption is high. Is it right or wrong. Dude you tell me how many recursion problems have you been solved???

If you know well then couldn't put this type of answer. Hope you understand well.

If you don't like then better to don't answering.

Answer 20

Erialdo Meta 🇦🇱 dude i have learned my first programing language since when i was in degree(class 13th). So i have been lots of doubt and no body could clear so...

I think, you are the master in programming and algo solving. Isn't it???