pankajkumar Posted May 30, 2013 Posted May 30, 2013 Show that f1(n)+f2(n)= o(m4*(g1(n),g2(n)) where f1(n)= o(g1(n)) and f2(n)=o(g2(n))? o is small o asymptotic notation and question is related to time complexity
EdEarl Posted May 30, 2013 Posted May 30, 2013 You should post in the Homework forum. Show as much work as you can when you post. Most people do not want to do your homework, but do want to help you do it.
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