Recall the Towers of Hanoi recursive solution for this problem. The solution to the Towers of Hanoi has a(n) __________ complexity.
A) linear
B) polynomial
C) logarithmic
D) exponential
E) bad

Question

Quizplus · Accepted Answer

The Towers of Hanoi problem has an exponential complexity, specifically O(2^n), where n is the number of disks. This is because each move involves solving two smaller problems and an additional move.

Recall the Towers of Hanoi Recursive Solution for This Problem