This question looks simple to me, but just wanted to see whether i am moving in the right direction.
Is it as simple as saying when n =1 ??
Asked
Active
Viewed 176 times
3
-
What do you mean by *"Is it as simple as saying when n =1 ??"*? – sch Mar 19 '12 at 02:48
-
I meant trivial case.. when number of inputs is 1.. – pa1geek Mar 20 '12 at 17:46
1 Answers
2
Yes, you are correct, if f is BigO(g) and f is Omega(g) then f is BigTheta(g). In fact, this is exactly the definition of BigTheta.
To apply that to algorithms, if an algorithm is both BigO(n^2) and Omega(n^2) for example, then it is BigTheta(n^2). And if it is BigTheta(n^2) then is is BigO(n^2) and Omega(n^2).
sch
- 27,436
- 3
- 68
- 83