Doubt Algorithms

Question

I wanted to know how θ is derived for a problem. Can we write it directly Example

n^4 + n^3+ n^2

Here worst case will be n^4 since it is the term with highest power(worst).

Similarly can i get θ

Comments

I think here Best + worst /2 is still n^4.

Hence $\Theta$ (n^4)

---

For analysis of average case u will have to consider the time complexity for all inputs and than take their average

here you will have to  first compute s= Σi^4 +  Σi^3  +  Σi^2  for i=0 to n than Θ(n)=s/n.

---

Ashwin how best case is n^4.how you came up that

---

Red devil i get. You sliced it well

Thanks for helping