1 year ago
#352704
Ram
Complexity of f(n) in Big O notation
for (i=1;i<n;i++)
{
i=i*2;
}
Can someone please explain what is the complexity of the above one?
For each iteration the of I is changing differently like I*2+2
.
time-complexity
big-o
0 Answers
Your Answer