O(2^n) - Exponential Time

Medium

Learn O(2^n) through subsets. Cases explode 2x at each choice!

ComplexityExponentialSubsets

O(2^n) has 2 choices per element, creating 2^n cases. Each +1 to N doubles the time!

1/11

Find all subsets of {A, B, C}. Subset: Select some (or all/none) from original set How many total?

Basics

O(2^n) has 2 choices per element, creating 2^n cases. Each +1 to N doubles the time!

Best

O(2^n)

Average

O(2^n)

Worst

O(2^n)

Space Complexity

O(n)

O(2^n) - Exponential Time | AlgoNote