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).
Answer:
if that is a tutorial, than just hit submit, the teacher doesn't see it.
Explanation:
i do online schooling on the same website
Answer:
C) double SHA-1 is stronger because it requires about 2^(160/3) X 2^(160/3) maximum combinations because for each broken first stage, there are 2^(160/3) brute force attempts may be needed.
Explanation:
Double SHA will require about 2^(160/3) X 2^(160/3). for each statage we need to check the 2^(160/3) combinations means it will take lot of time.
Answer:
ypite58eitetustietiejtejtejte6jhyeyry7ryjr
