Ask your own question, for FREE!
Computer Science 17 Online
OpenStudy (anonymous):

This is a question about big theta notation. So, Θ(g(n)) is the set of functions where Θ(g(n))={f(n): there exists positive constants c_1, c_2, and n_0 such that 0 <= c_1g(n) <= f(n) <= c_2g(n) for all n >= n_0} Why does this constraint exist? 0 <= c_1g(n) <= f(n) <= c_2g(n) for all n >= n_0 Where do they get the c_1g(n) from?

OpenStudy (anonymous):

Theta is a combination of Omega and O.

OpenStudy (anonymous):

They basically combined definitions. The purpose of the \(c_1g(n)\) is to ensure that is it \(f(n)\in \Omega(g(n))\) as well.

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!