simple big o question | Mathematics | Page 1

rose krakenBOT Jun 1, 2024, 7:05 PM

#

mortal vapor Jun 1, 2024, 7:10 PM

#

f2 is right, because although there is an n^c term, c=0.05 is such a small value, which is even smaller than sqrt(n) which would be n^0.5

#

nevermind me

#

you are right

#

maybe your professor put logn because n^0.05 only starts "overpowering" logn at such crazy high values of n

#

but you are right with f2 being O(n^0.05)

#

and f4 would be O(n * log_2(n)^2)

#

it is, you are completely right

mortal vapor Jun 1, 2024, 7:15 PM

#

mortal vapor and f4 would be O(n * log_2(n)^2)

this

rose krakenBOT Jun 1, 2024, 7:15 PM

#

Solved

Post marked as solved by @distant scarab.

Use .unsolved if this was a mistake.

mortal vapor Jun 1, 2024, 7:15 PM

#

but i guess maybe he put logn because in cs applications of big o notation

#

you dont really see values of n that high such that n^0.05 > logn

#

youre welcome

#

but if this was graded

#

i would 100% argue that n^0.05 > logn

#

as n -> inf

#

neat

#

still ask him anyways

#

@distant scarab and 1 more thing if ur ever confused on comparing 2 terms you can always plug in lim (term 1 - term 2) as x -> inf on wolframalpha and if its positive inf then term 1 grows faster and -inf then term 2 grows faster

#simple big o question