While to understand iteration, just keep studying until you're done.
But you still need to use recursion to prove that, in fact, you will eventually be done.
Halt! I see a problem.
You should halt if and only if you know you'll never halt.
By “recursion”, I didn't mean a “recursive algorithm”, but rather “induction on the loop counter” (a proof technique). Since proofs aren't meant to “run”, they don't need to “halt”.