An algorithm takes 0.5 ms for input size 100. How large a problem can be solved in 1 min if the running time is the following (assume low-order terms are negligible)?

Question

(a) linear

(b) O(NlogN)

(c) quadratic

(d) cubic

Could someone help?

Answer 1

That is 200 records per millisecond

1 minute * 60 seconds/minute * 1000 ms/sec * 200 records/ ms

=

12 million records processes per minute