Question: Big O notation 2. Suppose that we run an algorithm on test data and observe it taking taking 1.0s on an input of size 100,
2. Suppose that we run an algorithm on test data and observe it taking taking 1.0s on an input of size 100, 1.5s on an input of size 200, and 2.4s on an input of size 400. What is it's O-notation complexity most likely to be? What about .02s on an input of size 1000, 1s on an input of size 10000, 4s on an input of size 20000, and 15.3s on an input of size 40000
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
