Question

Give any example of an algorithm whose iterative version is much better than recursive version in terms of efficiency and state the reasons to justify the same.

Answer 1

Answer:

The fact is that recursion is rarely the most efficient approach to solving a problem, and iteration is almost always more efficient. This is because there is usually more overhead associated with making recursive calls due to the fact that the call stack is so heavily used during recursion....

✌❤#⃣✌❤#⃣✌❤#⃣✌❤#⃣

Answer 2

Answer:

Recursion is always applied to method whereas, iteration is applied to set of instruction. Variables created during recursion are stored on stack whereas, iteration doesn't require a stack. ... Due to function calling overhead execution of recursion is slower whereas, execution of iteration is faster.The fact is that recursion is rarely the most efficient approach to solving a problem, and iteration is almost always more efficient. This is because there is usually more overhead associated with making recursive calls due to the fact that the call stack is so heavily used during recursion

I hope this will help

plz mark brainliest ✊✌❤✌✊