Question: Suppose the exact time required for an algorithm A is given by the function TA(n) = 280n + (log 2 n)21n 2.5 +12n 3 +101+42n
Suppose the exact time required for an algorithm A is given by the function
TA(n) = 280n + (log2n)21n2.5+12n3 +101+42n
(a) (2 points) Which of the following statements are true?
1. Algorithm A is O(logn)
2. Algoirthm A is O(n)
3. Algoirthm A is O(n3)
4. Algoirthm A is O(2n)
(b) (1 point) Give the correct time complexity for A in big- notation.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
