Glossary: Algorithms Beyond the Basics in Java

exponential time

Also written: O(2ⁿ), O(1.6ⁿ)

A running time that multiplies with every extra item, such as 2ⁿ for subsets or about 1.6ⁿ for plain recursive `ways(n)`. It is only practical for small inputs.