Cruger Posted September 20, 2013 Posted September 20, 2013 I'm confused with the notations used in algorithm analysis. Can somebody compare and contrast "Big-Oh vs Big Omega vs Big-Theta" notations with respect to timeThank you......
AtomicMaster Posted October 1, 2013 Posted October 1, 2013 Big O - f is asymptotically bounded above by g - f is no faster than g Big Omega - f is either not bounded or asymptotically bounded below by g - f is no slower than g Big Theta - f is asymptotically bounded above and below by g - f is as fast as g
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now