The Towers of Hanoi solution has ___________ complexity, which is very inefficient. Yet the implementation of the solution is incredibly short and elegant.
A) quadratic
B) linear
C) exponential
D) none of the above

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 sub-problems of size n-1, plus the move of a disk, leading to exponential growth in the number of moves required as the number of disks increases. Despite this inefficiency, the algorithm to solve it is concise and elegant.

The Towers of Hanoi Solution Has ___________ Complexity, Which Is