Overview

Big O notation is a mathematical notation used to describe the efficiency of an algorithm. It provides a high-level understanding of the time or space complexity of an algorithm, which helps us predict how it will perform as the input size grows.

Prerequisites

• None

Learning Objectives

By the end of this module, learners will be able to:

• Explain how Big O notation is used to describe algorithms.
• Define constant, linear, quadratic, logarithmic, and factorial Big O runtimes.
• Analyze algorithms to determine their Big O runtime.

Content

There are two components to this module:

• Lesson: Big O Notation
• Exercise: Analyzing Algorithms

Solution code

• Exercise Solution: Big O Notation

Time to Complete

1.5 hours total:

• 0.5 hour - Big O Notation Lesson
• 1 hour - Analyzing Algorithms Exercise

Additional Resources

• The Big O Cheat Sheet: The authority on Big O complexities.

Internal resources

✏️ Instructor Guide

🏗️ Release Notes

---

Find a 👾 bug 👾 or have suggestions? Let us know!