0

Hi guys. Gotta a CS exam coming up this sunday and I want to clarify the difference between bigO and theta notation. I know that bigO is the upperbound and it has a constant after which all running time will be below. I know that theta has an upper and lower bound for this running time, but I'm still a bit confused. Here are some questions:

1) Do big-oh and theta both represent the worstcase for the running time?
2) How do I know when to use theta? I know it is better to use but how do I know when I can use it? Could someone give a simple example of when to use theta?


thanks in advanced,

arh

3
Contributors
3
Replies
4
Views
10 Years
Discussion Span
Last Post by Eko
1

>1) Do big-oh and theta both represent the worstcase for the running time?
They represent whatever case you're analyzing.

>2) How do I know when to use theta?
Theta is when you can achieve it. It's a much stronger claim than Big O because it's a tighter bound.

0

Thanks for the reply. I was able to figure it out by reading some other stuff online.

This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.