# Asymptotic Notation

Learn Big-O notation and how to determine the complexity of algorithms.

Start## Key Concepts

Review core concepts you need to learn to master this subject

Big-Θ Notation

Asymptotic Notation

Adding Runtimes

Algorithmic Common Runtimes

Big-O Notation

Big-Ω Notation

Analyzing Runtime

Queue Versus Stack

Big-Θ Notation

Big-Θ Notation

We compute the big-Θ of an algorithm by counting the number of iterations the algorithm *always* takes with an input of n. For instance, the loop in the pseudo code below will always iterate N times for a list size of N. The runtime can be described as Θ(N).

for each item in list: print item

Asymptotic Notation: Conceptual

Lesson 1 of 1

## How you'll master it

Stress-test your knowledge with quizzes that help commit syntax to memory