logo Practice-It logo

Main Page → Problems → Solve a Problem

BJP4 Self-Check 13.13: bigOh5

Language/Type: Java big-oh
Author: Marty Stepp (on 2016/09/08)

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 <= 1000000; j++) {
        sum += 10;
    }
}
sum += 9999;
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.