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 have the following code snippet:
sum = 0;
for (i = 0; i < n; i++)
for (j = 0; j < i; j++)
sum++;
The complexity would be O(n^2), but if I want to dig a little more for the internal loop complexity then would it be (n (n-1))/2 or (n-1)!?
Yes, O(n^2), but actually 0+1+…+n-1=n(n-1)/2 = O(n^2), definitely not (n-1)!