5. With proper justification express the time complexity of the following for loops using Big-oh notation...

Transcribed Image Text:

5. With proper justification express the time complexity of the following for loops using Big-oh notation a.. void function (int n) } b. int count = 0; for (int i=1; i<=n*n; i++) for (int j = 0; j<i; j++) count++; void function (int n) { } int count = 0; for (int i= 1; i<n; i++) for (int j-1; j+n/2<=n; j j++) for (int k=1; k<=n; k = k * 2) count++; 5. With proper justification express the time complexity of the following for loops using Big-oh notation a.. void function (int n) } b. int count = 0; for (int i=1; i<=n*n; i++) for (int j = 0; j<i; j++) count++; void function (int n) { } int count = 0; for (int i= 1; i<n; i++) for (int j-1; j+n/2<=n; j j++) for (int k=1; k<=n; k = k * 2) count++;

Answer rating: 100% (QA)

a The time complexity of the first for loop can be expressed as On3 or Big O of n cubed Justificatio... View the full answer