geth silbert quiz

What is the runtime of binary search?

• O(1)

• O(logn)

• O(log^2n)

• O(sqrtn)

Solve the recurrence relation.

• O(1)

• O(n)

• O(nlogn)

• O(n^2)

Pick the most appropriate answer.

• O(n)

• O(n^2)

• O(n^3)

• O(n^5)

Pick the most appropriate answer.

• O(1)

• O(n)

• O(nlogn)

• O(n^2)

The running time of the following code, as a function of n:

• O(1)

• O(n)

• O(n^2)

• O(n^3)

The running time of the following code, as a function of n:

• O(1)

• O(n)

• O(n^2)

• O(2^n)

The running time of the following code, as a function of n:

• O(n^2)

• O(n^2logn)

• O(n^3)

• O(2^n)

Solve the recurrence relation.

• O(n^2)

• O(n^2logn)

• O(n^3)

• O(n^3logn)

Solve the recurrence relation.

• O(n)

• O(nlogn)

• O(nlog^2n)

• O(n^2)

The running time of the following code, as a function of n:

• O(logn)

• O(log^2n)

• O(sqrtn)

• O(n)