Suppose you are given 3 algorithms A1,A2 and A3 solving the same problem. You know that...

Transcribed Image Text:

Suppose you are given 3 algorithms A1,A2 and A3 solving the same problem. You know that in the the running times are Ti(n) = n5", T₂(n) = 2¹0n²+n²³, T3(n) = 105 log10 (n") (a) Which algorithm is the fastest for very large inputs? Which algorithm is the slowest for very large inputs? (Justify your answer.) (b) For which problem sizes is A₂ the better than A₁? (Justify your answer.) (c) For which problem sizes is A₂ the better than A3? (Justify your answer.) Suppose you are given 3 algorithms A1,A2 and A3 solving the same problem. You know that in the the running times are Ti(n) = n5", T₂(n) = 2¹0n²+n²³, T3(n) = 105 log10 (n") (a) Which algorithm is the fastest for very large inputs? Which algorithm is the slowest for very large inputs? (Justify your answer.) (b) For which problem sizes is A₂ the better than A₁? (Justify your answer.) (c) For which problem sizes is A₂ the better than A3? (Justify your answer.)

Answer rating: 100% (QA)

Lets analyze the running times of the three algorithms Algorithm Ay T1nn5 Algorithm Az Tan2n2n3 Algo... View the full answer