LinuxQuestions.org

LinuxQuestions.org (/questions/)
-   Programming (http://www.linuxquestions.org/questions/programming-9/)
-   -   how to use Big O, Big Omega, and Big Theta to find running time of algorithms (http://www.linuxquestions.org/questions/programming-9/how-to-use-big-o-big-omega-and-big-theta-to-find-running-time-of-algorithms-868914/)

naveed17 03-16-2011 08:03 AM

how to use Big O, Big Omega, and Big Theta to find running time of algorithms
 
how to use Big O, Big Omega, and Big Theta to find running time of algorithms because it looks confusing which one of them to use..

paulsm4 03-16-2011 05:40 PM

Use Big O.

Big Omega is a dietary supplement, and Big Theta only works with radians (not degrees) ;)

Or look here, here, here or here.

salasi 03-17-2011 05:06 AM

Err, I thought I'd seen another post on this subject. Here is the years-and-years old thread. I guess that I must have noticed the necropost, rather than the original thread....

paulsm4 03-17-2011 10:25 AM

Hi, Salasi -

It's still a good post :)

naveed17 -

As far as "how to use" the different notations: please look at the links I cited. Or google for:
Quote:

asymptotic notation big o big theta
If you just want "something that works", then "big O" is probably the easiest to grasp and the most commonly used.

IMHO .. PSM


All times are GMT -5. The time now is 04:57 AM.