What is the first step in the Tower of Hanoi recursive algorithm?
A) Move the top n disks from needle 1 to needle 2, using needle 3 as the intermediate needle.
B) Move disk number n from needle 1 to needle 3.
C) Move the top n - 1 disks from needle 2 to needle 3, using needle 1 as the intermediate needle.
D) Move the top n - 1 disks from needle 1 to needle 2, using needle 3 as the intermediate needle.

Question

Quizplus · Accepted Answer

The first step in the Tower of Hanoi recursive algorithm is to move the top n - 1 disks from the source needle to the auxiliary needle, using the destination needle as the intermediate.

What Is the First Step in the Tower of Hanoi