# Lesson 35: Big-O Notation

In computer science, big O notation is used to classify algorithms according to how their run time or space requirements grow as the input size grows

## Characteristics

- O(1) — Constant
- O(log n) — Logarithmic
- O(n) — Linear
- O(n log n) — n log-star n
- O(n²) — Quadratic