# Question: 1 write the following pseudocode into java methods that receive...

###### Question details

1)

Write the following pseudo-code into Java methods that receive the
value 'n' as a parameter.

Summation One:

sum = 0;

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

sum++;

Summation Two:

sum = 0;

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

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

sum++;

Summation Three:

sum = 0;

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

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

sum++;

Summation Four:

sum = 0;

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

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

sum++;

Summation Five:

sum = 0;

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

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

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

sum++;

Summation Six:

sum = 0;

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

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

if(j%i == 0)

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

sum++;

a) For all 6 methods in #4, write out a formula to represent the growth rate of the method and reduce the formula to big-o notation.

b) For all 6 methods in #4, add a counter to keep up with every operation. Run the methods with N = 25, 50, 75, 100, 125, 150, 175, 200. Put the resulting operation counts into excel for each one and graph them. Also, solve the Big-O solutions from #5 and plot those next to each (if you multiply the Big-O by an appropriate constant, it should line up pretty closely)