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.
Suppose there are multiple functions with certain big o notations, anything O(N), O(N^2), etc.
If you have a code fragment such as.
f1(x);
f2(x);
f3(x);
Are all the big O notations added together or multiplied? Any explanation as to why either would be correct – addition or multiplication?
Neither. You would take the maximum.
Calling the larger piece of code
g… If for example O(f2) >= O(f1) and O(f2) >= O(f3), then the complexity ofgis <= 3 * O(f2) = O(f2).