0

The way every recursive version has an iterative version as well is this right saying that vice-versa is also true (i.e. every iterative version has recursive version)?

Madhav Chittlangia
  • 11
  • 3
  • 1
    Does this answer your question? [Can all iterative algorithms be expressed recursively?](https://stackoverflow.com/questions/2093618/can-all-iterative-algorithms-be-expressed-recursively) – eglease Nov 12 '21 at 15:23

1 Answers1

-1

In recursive approach, the function calls itself until the condition is met, whereas, in iterative approach, a function repeats until the condition fails.

Pratiksha Ramesh Anand
  • 1