Skip to content

Glossary: Coding Interviews in Java

Exponential time

Also written: O(2ⁿ)

Work that doubles with every extra item, written O(2ⁿ). It is fine for about 20 items (around a million steps) but far too slow for 50.

Where the book teaches it

Related terms

BacktrackingBig-O