Question: Consider the code below. What is its time complexity (using Big-O notation)? int total = 0; for (int i = 0; i < N; i++)
Consider the code below. What is its time complexity (using Big-O notation)?
int total = 0;
for (int i = 0; i < N; i++)
{
for (int j = 10; j >= 0; j--)
{
int count = 1;
while (count < N)
count *= 2;
}
total ++;
}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
