Compute the size of the problem that can be solved on a machine that takes 10 -9

sec/op in

one day when T(n) = 15n2

,8n3

,2n

,3n

, n!, n logn. Also plot T(n) vs n where n ∊ [2,20] on a graph

asked by guest
on Jan 23, 2025 at 7:14 pm



MathBot Answer:

MathBot is working on a solution to your problem.

Loading bar