Question: If an algorithm has a T(n) = 1 + 5n+ 3n^2, what is the algorithm's corresponding big-O notation? Select one: O a. 0(1) O
If an algorithm has a T(n) = 1 + 5n+ 3n^2, what is the algorithm's corresponding big-O notation? Select one: O a. 0(1) O b. O c. O d. O(n^2) O(1 + 5n + 3n^2) 0(3n^2) cross out cross out cross out cross out
Step by Step Solution
There are 3 Steps involved in it
The bigO notation describes the upper bound or the worstcase scenar... View full answer
Get step-by-step solutions from verified subject matter experts
