MCQOPTIONS
Saved Bookmarks
| 1. |
The time complexity of the solution tower of hanoi problem using recursion is _________ |
| A. | O(n2) |
| B. | O(2n) |
| C. | O(n log n) |
| D. | O(n) |
| Answer» C. O(n log n) | |