GATEverse
← GATE CSE 2002

Q11

NATMarks unknown

The following recursive function in C is a solution to the Towers of Hanoi problem. void move(int n, char A, char B, char C) { if (......................) { move (.............................); printf("Move disk %d from pole %c to pole %c\n", n, A, C); move (.....................); } } Fill in the dotted parts of the solution.

Sign in to save attempts.

Loading…