2
votes
Asymptotic Proof when f(n) & g(n) are known natural numbers
If you have two constant functions then they are obviously equivalent up to a constant factor, i. e., $cg(n) \le f(n) \le cg(n)$ therefore $f(n) = \Theta(g(n))$ by definition of $\Theta$.
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
asymptotics × 1468time-complexity × 265
algorithms × 230
landau-notation × 223
algorithm-analysis × 214
recurrence-relation × 209
big-o-notation × 175
runtime-analysis × 146
complexity-theory × 143
master-theorem × 68
terminology × 43
recursion × 39
proof-techniques × 34
data-structures × 33
sorting × 28
notation × 27
mathematical-analysis × 24
graphs × 19
upper-bound × 18
lower-bounds × 15
loops × 14
discrete-mathematics × 13
combinatorics × 12
arrays × 12
space-complexity × 10