Question: 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

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 worst than linear. Is he correct? 7
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
