java - What is the time complexity for this? -


nlog2n+3n^2+4n^3+n+10 

from polynomial supposed consider either o(n^3) or o(logn)

from log2n can have log2+logn right logn .like wise

what have consider please tell me?

actually it's o(m*n), unless have typo , both loops should iterate 0 n, in case o(n^2).


Comments

Popular posts from this blog

asp.net mvc - SSO between MVCForum and Umbraco7 -

Python Tkinter keyboard using bind -

ubuntu - Selenium Node Not Connecting to Hub, Not Opening Port -