Skip to content

Glossary: Data Structures and Algorithms in JavaScript

Logarithm

Also written: log n, log₂ n, logarithmic

The number of times n can be halved down to 1; log₂ 8 is 3 and log₂ 1,000,000 is about 20. It is why halving algorithms such as binary search are so fast.

Where the book teaches it

Related terms

Big-O notationBinary search