- #1

Avichal

- 295

- 0

I want an intuition on how iterative and recursive approaches are different. Just look at the simple arithmetic progression. n

^{th}term is given as a + n.d. This can be derived using both iterative and recursive methods.

I am looking for the basic idea behind both the approaches.

Also can all recursive solution be converted to iterative solution? In Fibonacci sequence can n

^{th}term be found iteratively?

So if all iteraitve and recursive solutions be interconvertible what's the basic difference between both, i mean the basic crux or logic behind both?

Ah, I still feel I couldn't convey my question!