# Big Theta of algorithm

1. Oct 8, 2013

### GeorgeCostanz

1. The problem statement, all variables and given/known data

i've been asked to find the asymptotic time complexity of an algorithm in Big Theta

78045522000 + n$^{2}$log$^{3}$n + n$^{3}$logn + 200n + 45$^{n}$

2. Relevant equations

3. 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$^{2}$log$^{3}$n + n$^{3}$logn + 200n + 45$^{n}$) (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