Tower of Hanoi (in c) recursion - How does it look in the memory?

Asked Mar 07 '19 at 19:36

Active Mar 08 '19 at 08:31

Viewed 27 times

I can't get my head of how the code compile because of the 2 times we need to call for n-1 to set it as the concept.

The code:

void tower(int n, char A, char B, char C)
{
    if (n == 0)
        return;
    else
    {
        tower(n - 1, A, C, B);
        printf("Disk %d from %c to %c\n", n, A, B);
        tower(n - 1, C, B, A);
    }
}

int main()
{
    tower(3, 'A', 'B', 'C');
}

Can someone help with to understand how it is execute in the compiler/stack for each step?

Hope you guys can help me with that. Thanks!

edited Mar 08 '19 at 08:31

asked Mar 07 '19 at 19:36

supersonic182

Use a debugger that allows you to visualize the call stack/graph. Or draw it out on a piece of paper, pretending that you are executing the code. – Cody Gray - on strike Mar 08 '19 at 08:42

Tower of Hanoi (in c) recursion - How does it look in the memory?

0 Answers0