Question: Please show all steps HW2A.8. Time Complexity The time cost of an algorthm depends on the size n f he nput and is proportional to
Please show all steps
HW2A.8. Time Complexity The time cost of an algorthm depends on the size n f he nput and is proportional to some power of n (i.e. the algorithm takes O(n) time for some z). If the algorithm takes 81 seconds with n 1200 and it takes 3 seconds with n 400, what is the order of the time cost (i.e. what is z in O(n)) Note: Round the answer to the nearest integer. order 3 ? 10096 Try question again
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
