A growth-rate function is a mathematical function used to indicate an algorithm's time efficiency in terms of the size of the problem.

a. True b. False

If a problem of size n requires time that is directly proportional to n, the problem is ______.

a. O(1) b. O(n) c. O(n2) d. O(log2 n)

The recursive binary search algorithm is a logarithmic algorithm.

a. True b. False

Which of the following growth-rate functions indicates a problem whose time requirement is constant?

a. 1 b. n c. n2 d. log2 n