Time Complexity Classes: Exponential Complexity
Exponential Complexity:
- The algorithm takes an amount of time that grows “much much faster” than the size of the problem. (e.g. when the problem is 10 times the original size, the time it takes to solve the problem is 1000 times more!)
- This class of algorithms is basically impractical for large problem sizes. Example complexities that are exponential include 2^N, 10^N, N^N, etc...