Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I need to derive the Big-O complexity of this expression:
c^n + n*(log(n))^2 + (10*n)^c
where c is a constant and n is a variable.
I’m pretty sure I understand how to derive the Big-O complexity of each term individually, I just don’t know how the Big-O complexity changes when the terms are combined like this.
Ideas?
Any help would be great, thanks.
The O() notation considers the highest term; think about which one will dominate for very, very large values of
n.In your case, the highest term is
c^n, actually; the others are essentially polynomial. So, it’s exponential complexity.