Consider four programs—A, B, C, and D—that have the following performances:
A: O(log n)
B: O(n)
C: O(n2)
D: O(2n)
If each program requires 10 seconds to solve a problem of size 1000, estimate the time required by each program for a problem of size 2000.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.