1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Big Theta of algorithm

  1. Oct 8, 2013 #1
    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[itex]^{2}[/itex]log[itex]^{3}[/itex]n + n[itex]^{3}[/itex]logn + 200n + 45[itex]^{n}[/itex]

    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[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
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted