I need an analysis of the running time for the following problem. Big Oh will do

Question

I need an analysis of the running time for the following problem. Big Oh will do. The code is listed below.

1. sum =0 ;

for (i=0;, i < n; ++i)

++sum;

2. sum =0 ;

for (i=0;, i < n; ++i)

for ( j = 0; j < n; ++j)

++sum;

3. sum=0;

for (i =0; i<n; ++i)

for (j =0;, j < n * n; ++j)

++sum;

4. sum =0;

for (i=0; i < n; ++i)

for (j =0; j < i; ++j)

++sum;

5. sum=0;

for (i = 0; i < n; ++i)

for ( j = 0; j < i * i; ++j)

for ( k = 0; k < j; ++k)

++sum;

6. sum=0;

for ( i =1; i < n; ++i)

for ( j = 1; i < i * i; ++j)

if ( j % i ==0)

for (k = 0; k < j; ++k)

++sum;

Explanation / Answer

O (n^3)

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.