CMSC 256 exam 2 vcu ACTUAL UPDATED QUESTIONS AND CORRECT ANSWERS
for (int i = 0; i < n; i++) O(n)
sum++;
What is the big O?
for (int i = 0; i < n; i += 2) O(n)
sum++;
What is the big O?
for (int i = 0; i < n; i++) O(n^2)
for (int j = 0; j < n; j++)
sum++;
What is the big O?
for (int i = 0; i < n; i++) O(n)
sum++;
for (int j = 0; j < n; j++)
sum++;
What is the big O?
for (int i = 0; i < n; i++) O(n^3)
for (int j = 0; j < n * n; j++)
sum++;
What is the big O?
for (int i = 0; i < n; i++) O(n^2)
for (int j = 0; j < i; j++)
sum++;
What is the big O?
for (int i = 1; i < n; i = i * 2) O(logn)
sum++;
What is the big O?
for (int i = 0; i < n; i++) O(n^5)
for (int j = 0; j < n * n; j++)
for (int k = 0; k < j; k++)
sum++;
What is the big O?
for (int i = 0; i < n; i++) O(n)
sum++;
What is the big O?
for (int i = 0; i < n; i += 2) O(n)
sum++;
What is the big O?
for (int i = 0; i < n; i++) O(n^2)
for (int j = 0; j < n; j++)
sum++;
What is the big O?
for (int i = 0; i < n; i++) O(n)
sum++;
for (int j = 0; j < n; j++)
sum++;
What is the big O?
for (int i = 0; i < n; i++) O(n^3)
for (int j = 0; j < n * n; j++)
sum++;
What is the big O?
for (int i = 0; i < n; i++) O(n^2)
for (int j = 0; j < i; j++)
sum++;
What is the big O?
for (int i = 1; i < n; i = i * 2) O(logn)
sum++;
What is the big O?
for (int i = 0; i < n; i++) O(n^5)
for (int j = 0; j < n * n; j++)
for (int k = 0; k < j; k++)
sum++;
What is the big O?
