Please enable JavaScript to use CodeHS

APCSP20: AAP-4.A.7

CodeHS Lessons

Algorithms with efficiencies that grow at a polynomial rate or slower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time. Algorithms with efficiencies that grow at an exponential or factorial rate are example of algorithms that run in an unreasonable time.

Standard
7.6 Finding an Element in a List
Standard
7.3 For Loops and Lists
Standard
7.6 Finding an Element in a List
Standard
7.6 Finding an Element in a List
Standard
6.6 Finding an Element in a List
Standard
6.6 Finding an Element in a List
Standard
4.6 Finding an Element in a List
Standard
5.3 For Loops and Lists