O(log n) - Logarithmic Time

Easy

Learn O(log n) with binary search. Discard half each time for incredible speed!

ComplexityBinary SearchLogarithm

O(log n) halves the work each step. Doubling data only adds one more step.

1/14

Find 41 in sorted array. [3, 7, 12, 18, 25, 33, 41, 55] How many steps for 8 items?

Basics

O(log n) halves the work each step. Doubling data only adds one more step.

Best

O(1)

Average

O(log n)

Worst

O(log n)

Space Complexity

O(1)

O(log n) - Logarithmic Time | AlgoNote