A. Given the choice of four algorithms that perform the same operation with the below Big-O complexities, which of the four would be preferred?

1. O(n log(n))

2. O(n²)

3. O(log(n))

4. O(n)

B. Which is the Big-O complexity for the following code?

for(int i = 0; i < n; ++i) cout << i << endl; for(int j = 0; j < n; ++j) cout << j << endl; 

1. O(i + j)

2. O(n)

3. O(i * j)

4. O(n²)

C. Which of the following T(n) functions defines the best case for the following code?

for(int i = 0; i < n; ++i) if(i % 2 == 1) odds++;

Hint: rewrite to a while loop if needed.

1. T(n) = 4n + 2

2. T(n) = 3n + 1

3. T(n) = 4n + 1

4. T(n) = 3.5n + 2