- #1
gfd43tg
Gold Member
- 950
- 50
Homework Statement
In this question you will determine the asymptotic time complexity of an algorithm for which the complexity is ##T(n)=n^{2}+3##.
Find a positive real c and a positive integer ##k##, such that
##T(n) \le cf(n)##
holds for all ## n>k ## if ##f(n) ## is the asymptotic time complexity.
What is the best choice for ##f(n)##?
[ans]
What is a good choice for ##c## such that ##k## is small (i.e. less than 10)?What is ##k##?
Homework Equations
The Attempt at a Solution
I am confused how to approach these problems. Unfortunately the choices for ##f(n)## are not visible, there is a bug in the problem. But I was wondering what I should do in order to do these problems. The notes are not adequate (or available to look at, since that is bugged as well).