Question: Ex: Suppose an algorithm has a complexity function: T(n) = n*log(n) + 7*n + 3*n + 11 Q: Which asymptotic notations does T(n) belong
Ex: Suppose an algorithm has a complexity function: T(n) = n*log(n) + 7*n + 3*n + 11 Q: Which asymptotic notations does T(n) belong to if g(n) = n? Q: Which asymptotic notations does T(n) belong to if g(n) = 0.02*n? Q: Which asymptotic notations does T(n) belong to if g(n) = 6*n?
Step by Step Solution
There are 3 Steps involved in it
1 If gn n then Tn belongs to the On log n and n log n asymptotic notations To see why we can use the definition of bigO notation We say that Tn is in ... View full answer
Get step-by-step solutions from verified subject matter experts
