Menu

Time Complexity Following Fragment Code Big O Notation K 0 K N 2 K Statements J 0 J N N J Q43883032

The time complexity of the following fragment of code in thebig-O notation is:

for (k = 0; k , n/2; ++k)

{

some statements ………

for (j = 0; j < n*n; ++j)

{

some statements ………

}

}

In the possible answers, n^n denotes nn

a) O(n)

b) O(n^2)

c) O(log n)

d) O(n^3)

Expert Answer


Answer to The time complexity of the following fragment of code in the big-O notation is: for (k = 0; k , n/2; ++k) { some stateme…

OR