Practice
Learn
← Quit
0 / 0 correct
Algorithms
Medium
1 of 59
How many subsets does a set of n elements have, and what does that imply for brute force?
A
2^n, so subset enumeration is exponential and only viable for small n (~20–25)
B
n log n
C
n^2
D
n!