algorithm - Lower bounds for logarithmic functions -


i asked similar question before want ask follow question on lower bounds or omega. following recurrence,

t2(n)=n2.001 + n2logn

t2(n)=o(n2.001). have no problems that. told lower bounds, t2(n)=Ω(n2.001) though n2logn supposed smaller n2.0001. help?

big omega used lower bound, t2(n)=Ω(n^2 * logn) valid. however, t2(n)=Ω(n^2.001) offers tighter lower bound.


Comments

Popular posts from this blog

html - Outlook 2010 Anchor (url/address/link) -

javascript - Why does running this loop 9 times take 100x longer than running it 8 times? -

Getting gateway time-out Rails app with Nginx + Puma running on Digital Ocean -