tower of hanoi time complexity all cases code example Example: tower of hanoi worst case time complexity O(2^n) [exponential time]