← AP CSP

Efficiency: AP CSP practice

How fast algorithms grow. 4 questions in the style of the AP CSP exam.

Sample questions

For an input of size n, which of these algorithms does NOT run in a reasonable amount of time?

  1. One that takes about 2 to the power n steps
  2. One that takes about n steps
  3. One that takes about n squared steps
  4. One that takes about n cubed steps