Concept drill
towers of hanoi
GATE CSE & IT · Algorithms - Time Complexity · 2012-2017
2
PYQs
100%
keyed
0
elite explanations
2
years appeared
Study anchor
Source-book anchor pending for this concept.
Practice action
Start latest PYQPYQs in this concept
All concepts →2017 Q3
Match the algorithms with their time complexities: Algorithm (P) Towers of Hanoi with n disks (Q) Binary search given n sorted numbers (R) Heap sort given n numbers at the worst ca...
mediumanswer key
2012 PYQ
The recurrence relation capturing the optional execution time of the Towers of Hanoi problem with $$n$$ discs is
easyanswer key