0 votes
98 views

Hello anyone can help me to find big O for this algorithm please.... 

f=1;

x=3;

for (int i = 1; i <= n; i*=2) 
   for (int j = 1; j <= i * i; j++) 
      if (i % j == 0) 
      for (int k = 1; k <= j; k++) 
         f=f*x;

in Algorithms by (5 points) 98 views
0
Is ans O(n)?

2 Answers

0 votes

O(n^2)

by (349 points)
0 votes

O(n4)

by Active (1.2k points)

Related questions

...