logo Practice-It logo

Main Page → Problems → Solve a Problem

BJP3 Self-Check 13.12: bigOh4

Language/Type: Java big-oh
Author: Marty Stepp (on 2013/04/01)

Approximate the runtime of the following code fragment, in terms of n: Write your answer in a format such as "O(N^2)" or "O(N log N)" (without the quotes). 

int sum = 0;
for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j += 2) {
        sum += 4;
    }
}
for (int k = -50; k <= -1; k++) {
    sum--;
}
big-oh

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.