Algorithm Complexity how do I tell

[zeion]

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?

 

[Max.Planck]

In the order of the dominant term. So the term that is going to matter most when n is large.