Question: 3. A student is required to state whether or not a certain algorithm is O(n). The student calculates that the algorithm takes approximately 1,000,000 steps

3. A student is required to state whether or not a certain algorithm is O(n). The student calculates that the algorithm takes approximately 1,000,000 steps for an input size n=100. Based on this observation, the student reasons that the algorithm cannot possibly be linear, but must be much worse than linear. Is he correct
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
