Iteration means the act of repeating.
When used in the first sense, recursion is an example of iteration, but typically using a recursive notation, which is typically not the case for iteration.
However, when used in the second (more restricted) sense, iteration describes the style of programming used in imperative programming languages. This contrasts with recursion, which has a more declarative approach.
Here is an example of iteration, in imperative pseudocode:
var i, a := 0 // initialize a before iteration
for i from 1 to 3 { // loop three times
a := a + i // increment a by the current value of i
}
print a // the number 6 is printedIn this program fragment, the value of the variable i changes over time, taking the values 1, 2 and 3. This changing value—or mutable state—is characteristic of iteration.
Iteration can be approximated using recursive techniques in functional programming languages. The following example is in Scheme. Note that the following is recursive (a special case of iteration) because the definition of "how to iterate", the iter function, calls itself in order to solve the problem instance. Specifically it uses tail recursion, which is properly supported in languages like Scheme so it does not use large amounts of stack space.
(define (iter n i)
(if (= n 1)
i
(iter (- n 1)(+ n i))))
(iter n 1))
An iterator is an object that wraps iteration.