Ask your own question, for FREE!
Mathematics 20 Online
OpenStudy (anonymous):

Assume again two (positive) functions f and g such that f(n)=O(g(n)). Is 2f(n)=O(2g(n)) ? (Multiple answers may be correct.) Always Sometimes Never Yes if f(n)≤g(n) for all sufficiently large n

OpenStudy (anonymous):

always and yes is my answer. what do you think

OpenStudy (turingtest):

what is O(g(n)) ???

OpenStudy (turingtest):

some unknown function?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!