Exercise V
- Use the mathematical definition of Big Omega to prove the asymptotic running time of a given program.
Consider the following function describes the precise running time of an algorithm:
Exercise Show .
Solution
We can choose and for the definition of Big-Oh to hold.
Similar to the definition of Big-Oh, the choice of and are not unique.
Exercise Show .
Solution
For any and , the definition of Big-Oh to hold.
Big-Omega expresses a lower bound, but it is not necessarily a tight lower bound.
Exercise Show .
Solution
We can choose and for any we have
So is really an upper bound for and not a lower bound.