Question

time complexity questions like :

h(n)=O(n2);

f(n)= O(logn);

g(n)=omega(n2);

what is the complexity of ::::  1. h(n)-g(n)=??

                                              2. h(n)-f(n)=???

elaborate plz

Comments

From where you got this , h(n)-g(n)? I dont think this can be computed, we generally add complexity but not substracted.

I think (1) O(n²) and for (2) o(n²)

---

There is no concept of substratction in complexity???????

Answer 1

Subtraction doesn't affect the Bound

1. h(n)-g(n)=Ω (n²) as we have a lower bound on g(n)

2. h(n)-f(n)=Ο (n²), max(h(n),f(n))