O(2 to the n) Exponential
← Back to Common Classes
Exponential time complexity. The running time doubles with each additional input element. Characteristic of brute-force solutions to NP-hard problems like the traveling salesman, subset sum, and recursive Fibonacci without memoization.