please wait
- Forum
- General C++ Programming
- Need help!!!!
Need help!!!!
Jun 9, 2018 at 3:06pm
Hello ..how to calculate complexity for this algorithm
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;
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;
Last edited on Jun 9, 2018 at 3:07pm
Jun 9, 2018 at 3:24pm
This guy is just being a dick now.
(Another repeated question.)
I request that his account be deleted.
(Another repeated question.)
I request that his account be deleted.
Topic archived. No new replies allowed.