Hi,(adsbygoogle = window.adsbygoogle || []).push({});

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?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Algorithm Complexity how do I tell

**Physics Forums | Science Articles, Homework Help, Discussion**