1

While reading Code Complete second edition, I came across this line:

You can do anything with stacks and iteration that you can do with recursion.

Is this true? or there are functions, that must be implemented recursively, and can't be done otherwise ?

Bite Bytes
  • 249
  • 1
  • 7

1 Answers1

1

Your CPU uses stacks and iteration to run any program, including programs based on recursion.

If you are unsure how this works, I suggest picking up an appropriate textbook.

Yuval Filmus
  • 276,994
  • 27
  • 311
  • 503
  • I'm talking at a higher level, for example, can the C language be used to implement any recursive function, in an iterative way? because recursive functions, though sometimes they look simple an elegant, they might eat a lot of memory stack, and might cause a stack overflow. – Bite Bytes Oct 23 '17 at 14:01
  • Recursive functions are implemented on actual hardware using a stack. You can't escape this. – Yuval Filmus Oct 23 '17 at 14:02
  • Also, actual computers can also run out of heap space. When we say that stacks and iteration can simulate recursion, we consider an idealized computer. – Yuval Filmus Oct 23 '17 at 14:06