Skip to content

Glossary: Coding Interviews in C++

Exponential time

Also written: O(2ⁿ)

Work that doubles with every extra item, as when listing all subsets. It is fine for about 20 items and hopeless for 50.

Where the book teaches it

Related terms

BacktrackingBig-O