Glossary: Algorithms Beyond the Basics in Rust

Exponential time

Also written: O(2ⁿ), 2ⁿ

Work that doubles (or more) with every extra item, like listing all subsets (2ⁿ) or the plain shelf recursion (about 1.6ⁿ). It is only affordable for small inputs, roughly n up to 25.