Why Recursion is tough but Beautiful as well ?

Question

I would like to make all programs in recursion but it takes lot of time.

Answer 1

Building a recursive structure requires a different thought process compared to building iterative ones. It's not tough, just different and hence requires some time to get used to.

I wouldn't advice making all programs work recursively though. Why hurt yourself.

Answer 2

Think fractals - recursive patterns in Nature like snowflakes 🧐 They are essentially recursive patterns !🌻

Answer 3

If you want an example of recursion , here is one:

https://code.sololearn.com/cOghumul288E/?ref=app

Answer 4

It's beautiful because it can make the code look/feel neat. It's tough maybe for a beginner if they don't handle the base case well and they run into infinite recursion.

Answer 5

Infinite recursion = stack overflow 🦀

Answer 6

IMHO the classic example of recursion is Fibonacci series 🤔

Answer 7

I think recursion looks good but show worst perfomance sometimes.First of all in some calculations u can use cycle with data inside and one instance of function. Its almost always less data in memory when u use many instance of function with same data. And second u spend processor time to read and write all of this excessivly data.
But i use it:) because sometimes understand algorithm really easy in recursive.

Answer 8

Some problem is recursive, some other iterative, in its nature. Someone else is functional... Happy coding, whatever your style!

Answer 9

Ifyou need help then stackowerwolf website 👍🏻👍🏻👍🏻

Answer 10

Sometimes recursion is the way to go, but other times iteration is better. In general, recursion is slow because function calls are slow and recursion also risks infinite loops and stack overflow. However, some things like fractals and the Towers of Hanoi work well with recursion; it just depends on the program structure you need to solve a particular problem.

Answer 11

😑