engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Algorithms Algorithm Design Techniques
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with ṅ discs is
1
T(n) = 2T(n − 2) + 2
2
T(n) = 2T(n − 1) + n
3
T(n) = 2T(n/2) + 1
4
T(n) = 2T(n − 1) + 1