I'm not sure if I'm getting the correct time complexity, any guidance will be appreciated.
int count =0;
for (i=0;i<=n;i++)
{
for (int j=1;j<=i;j++)
{
count ++
}
}
Im working out logn, not sure if my maths is off.
Asked
Active
Viewed 41 times
1
-
It's not log(n), it's O(n*i). – Eli Sadoff Dec 03 '16 at 21:20
-
I believe this is `O(n^2)` – smac89 Dec 03 '16 at 21:20
-
thanks will check it out now, both duplicate and maths on my part – WWBM Dec 03 '16 at 21:23