for (int count=0; count < n; count++)
{
for (int count2=0; count2 < n; count2=count2*2)
{
System.out.println(count, count2);
}
}
So, here growth function is
Hence, order be
2.
The order of the growth function are listed below -
a)
b)
c)
d)
3.
Here
Initial value of n=10
and final value of n= 1000
If the for loop is is proceeding
for(n=10;n=<1000;n++)
print(n)
The resultant series will be 10, 11, 12, .... 1000
f(n) =n-10
here n=<1000
complexity O(n)
Comments