In the context of optimization algorithms, what is the time complexity of a typical algorithm that exhibits exponential growth with the size of the input, such as certain NP$-$hard problems?

$O(1)$

$O(n)$

$O(logn)$

$O(2^n)$