Turn in Friday, 9/11

2.1

2.2

2.5

Analyze the big-Oh efficiency for each of the following code segments:

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; j < i * i; j++ )

if( j % i == 0 )

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

sum++;

2.11

2.15