Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Algorithm Complexity how do I tell

  1. Mar 13, 2012 #1
    Hi,

    If the algorithm recurrence can be shown to belong to something complicated say like

    T(n) = log_{3/2} n lg(n) + (log_{3/2}(n) (log_{3/2}(n) - 1 ) /2) lg(2/3)

    What order of complexity can I expect it to be in?
     
  2. jcsd
  3. Mar 17, 2012 #2
    In the order of the dominant term. So the term that is going to matter most when n is large.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook