Using a recursive algorithm to solve the Tower of Hanoi problem, a computer that can generate one billion moves per second would take ____ years to solve the problem.
A) 39
B) 400
C) 500
D) 10,000

Question

Quizplus · Accepted Answer

The Answer of Using a recursive algorithm to solve the Tower of Hanoi problem, a computer that can generate one billion moves per second would take ____ years to solve the problem.
A) 39
B) 400
C) 500
D) 10,000

Using a Recursive Algorithm to Solve the Tower of Hanoi