Hi,

I am a newbie. I am studying Algorithms for the very first time in this semester, so please dont get annoyed by my question.

The time complexity of the loop e.g for(int i=0;i<N;i++) is O(N). Now what would be the time complexity of the loop that isnt incremented by one.

eg

```
int i=1;
while(i<N)
{
for(int j=1; j<N; j *= 5)
{
for(int k=0;k<N;k++)
cout<<”Complexity Analysis”;
}
i=i*3;
}
```