Back to Big Idea 3: Algorithms & Programming

Lesson PreviewLesson 17 of 18 in this unit

3.17 Algorithmic Efficiency

Part of Big Idea 3: Algorithms & Programming in AP® Computer Science Principles. Read the opening section, then create a free account for the full interactive lesson, practice, and progress tracking.

Start free

Algorithmic efficiency describes how the performance of an algorithm changes as the size of the input increases. Some algorithms take more steps than others to solve the same problem. Even if two algorithms produce the same result, one may be much faster or use fewer resources.

In this unit

18 lessons

  1. 3.1Variables and AssignmentsPreview lesson
  2. 3.2Data AbstractionPreview lesson
  3. 3.3Mathematical Expressions in ProgrammingPreview lesson
  4. 3.4StringsPreview lesson
  5. 3.5Boolean ExpressionsPreview lesson
  6. 3.6ConditionalsPreview lesson
  7. 3.7Nested ConditionalsPreview lesson
  8. 3.8IterationPreview lesson
  9. 3.9Developing AlgorithmsPreview lesson
  10. 3.10ListsPreview lesson
  11. 3.11Binary SearchPreview lesson
  12. 3.12Calling ProceduresPreview lesson
  13. 3.13Developing ProceduresPreview lesson
  14. 3.14LibrariesPreview lesson
  15. 3.15Random ValuesPreview lesson
  16. 3.16SimulationsPreview lesson
  17. 3.17Algorithmic EfficiencyThis lesson
  18. 3.18Undecidable ProblemsPreview lesson

Continue the full lesson in Stellar

Create a free account to unlock the remaining sections, checkpoints, course practice, and progress tracking for AP® Computer Science Principles.

Start free