MCQOPTIONS
Saved Bookmarks
| 1. |
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is |
| A. | T(n) = 2T(n − 2) + 2 |
| B. | T(n) = 2T(n − 1) + n |
| C. | T(n) = 2T(n/2) + 1 |
| D. | T(n) = 2T(n − 1) + 1 |
| Answer» E. | |