Big O Notation Issue

How can we help?

ch.wardzinski

October 26, 2021 15:15

What does 8^n is Omega4^n says? Does it mean 8^n runtime could be at least like 4^n runtime at some value?
Does Omega express lowest runtime increasement in comparison to O(n) highest runtime increasement and below? And if 8^n grows always faster than 4^n why compare them anyhow???

New post

1 comment

Evan Lewis

March 09, 2022 17:13
0

Comment actions Permalink
For anyone who is still wondering about this, I encourage you to visit our article on Omega notation: https://www.khanacademy.org/computing/computer-science/algorithms/asymptotic-notation/a/big-big-omega-notation

There's also tons of helpful questions and answers located beneath the article that can offer additional clarification!

Please sign in to leave a comment.

Big O Notation Issue

Didn't find what you were looking for?

1 comment

Didn't find what you were looking for?