Maybe this question better belongs to programming section but I feel it has mathematics related doubt. I want an intuition on how iterative and recursive approaches are different. Just look at the simple arithmetic progression. nth 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 nth term be found iteratively? So if all iteraitve and recursive solutions be interconvertible whats the basic difference between both, i mean the basic crux or logic behind both? Ah, I still feel I couldn't convey my question!