Question

Analyze the following programs and show their time complexity functions and big-O notations.

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

{

for(int j=1; j <= n; j++)

{

if (j % 3 == 0)

{

// 4 assignments

}

if (2*i + 3 == 5)

{

// 17 assignments

}

}

}

Answer 1

As i is incremented by 3 every time 
Number of values for i are n/3

As j is incremented by 1 every time
Number of values for j are n

So, Time complexity = O(Product of time complexities of two nested loops)
                    = O((n/3) * n)
                    =