Suppose that a particular algorithm has time complexity T(n) = 3 \times 2^nT(n)=3×2 n and that executing an implementation o

Question

3 years ago

14

Suppose that a particular algorithm has time complexity T(n) = 3 \times 2^nT(n)=3×2 n and that executing an implementation o

f it on a particular machine takes tt seconds for nn inputs. Now suppose that we are presented with a machine that is 64 times as fast. How many inputs could we process on the new machine in tt seconds?

Computers and Technology

1 answer:

Digiron [165] · Answer 1 · 2022-05-11T21:03:28+03:00

Digiron [165]3 years ago

3 0

Hope this helps!

https://www.chegg.com/homework-help/questions-and-answers/suppose-particular-algorithm-time-complexity-t-n-3-x-2-n-executing-implementation-particul-q18423534

Suppose that a particular algorithm has time complexity T(n) = 3 \times 2^nT(n)=3×2 ​n ​​ and that executing an implementation o

Suppose that a particular algorithm has time complexity T(n) = 3 \times 2^nT(n)=3×2 n and that executing an implementation o