Question: Assume that algorithm A1 takes time roughly T1(n)= 6n^2+ 2n +12 and algorithm A2 takes time roughly T2(n)= 4T2(n/2) + 100n, and suppose that computer
Assume that algorithm A1 takes time roughly T1(n)= 6n^2+ 2n +12 and algorithm A2 takes time roughly T2(n)= 4T2(n/2) + 100n, and suppose that computer A's CPU runs 10^8 instructions/sec. When the input size equals to 10^2, 10^6, and 10^12 respectively, how long will algorithm A1 take to finish for each input size? How long will algorithm A2 take to finish for each input size?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
