Question

If I have some algorithm that runs at best n time and at worst n^2 time, is it fair to say that the algorithm is Big Omega (n)?

Does this mean that the algorithm will run at least n (time)?
I am just not sure if I have the right idea here.

Thanks.

Answer 1

For Big Oh, you will state the worst time as the time it takes, in your case O(n^2). For Big Omega, you state the smallest time, in this case f(n).

Also see this guide to Big O and this discussion of Big O and Big Omega.