what is the time complexity of:
for (i = 1; i <= n; i = 2*i)
for (j = 0; j < i; j++)
sum++;
? I thought it is O(nlogn) since the otter loop run logn time and the inner loop run i time
$\begingroup$
$\endgroup$
3
-
1$\begingroup$ This site doesn't work that way. Help us to help you: why do you doubt your answer? what don't you understand? We're not a verifier service. $\endgroup$Rick Decker– Rick Decker2023-10-13 13:32:13 +00:00Commented Oct 13, 2023 at 13:32
-
$\begingroup$ My question is what is the complexity of the provided code ? $\endgroup$user163594– user1635942023-10-13 17:00:13 +00:00Commented Oct 13, 2023 at 17:00
-
1$\begingroup$ Always helpful when you don’t have experience yet: Write a program that counts your operations and prints them. Check the output, make a guess check the guess. You’ll see it’s unlikely to be n log n. $\endgroup$gnasher729– gnasher7292023-10-17 16:57:40 +00:00Commented Oct 17, 2023 at 16:57
Add a comment
|
