Question: 2- An algorithm with worst case complexity 30*(32)n/5 runs on a machine which needs 1/2 seconds to execute one basic operation . Calculate the maximum

2- An algorithm with worst case complexity 30*(32)n/5 runs on a machine which needs 1/2 seconds to execute one basic operation . Calculate the maximum input size for the machine , which can be handled in T time , where T = 64 minutes.
2- An algorithm with worst case complexity 30*(32)/5 runs on a machine which needs 1/2 seconds to execute one basic operation Calculate the maximum input size for the machine, which can be handled in T time, where T = 64 minutes. |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
