Hello,
A computers operating system manages the software and hard ware on the computer.
Thanks for using brainly.
Answer:
B.O(2n)
Explanation:
The time complexity of solving towers of hanoi problem recursively is O(2n) because there are two recursion calls in the solution of tower of hanoi.First recursive call to move n-1 disks to from source to helper then the user moves nth disk from source to destination after that recursion moves n-1 disks from helper to destination using source as helper rod.So each recursive call make two more recursive call this makes the time complexity be O(2n).
Hey men, i recommend, not saying that here, do that with a friend or someone but no here aight? <span />
Answer:
It’s not that important but you can use it to help organize and grow your business.
Explanation:
