Question

Can each recursive function be represented through interation? Guve example​

Answer 1

Explanation:

Any recursive algorithm can be expressed as an iterative algorithm, but you may need to keep an explicit stack (corresponding to the call stack that's handled implicitly). ... Tail-recursive functions can be easily translated into loops, and don't need a stack, but that's a special case.

Answer 2

Answer:

Hello!Hope your safe.....

Here's your answer

Explanation:

The concept of Recursion and Iteration is to execute a set of instructions repeatedly. The difference between them is that recursion is simply a method call in which the method being called is the same as the one making the call while iteration is when a loop is repeatedly executed until a certain condition is met.

So..your answer is "YES"

HOPE THIS HELPS....

PLS MARK BRAINLIEST...

I'M TRYING TO GAIN A NEW RANK..PLS HELP