- #1
GeorgeCostanz
- 31
- 0
Homework Statement
i've been asked to find the asymptotic time complexity of an algorithm in Big Theta
78045522000 + n[itex]^{2}[/itex]log[itex]^{3}[/itex]n + n[itex]^{3}[/itex]logn + 200n + 45[itex]^{n}[/itex]
Homework Equations
The Attempt at a Solution
from my understanding Big Theta is a tight/exact bound, but I'm not sure how to write the proper answer.
i came to the conclusion it's = Big Theta(n[itex]^{2}[/itex]log[itex]^{3}[/itex]n + n[itex]^{3}[/itex]logn + 200n + 45[itex]^{n}[/itex]) (removing constants, including both upper and lower bounds)
i'd appreciate it if someone could let me kno how wrong I am and set me on the right track