Lg n

• We say that the binary search algorithm runs in lg n time.

• Lg n means the log to the base 2 of some value of n

• 8 = 23 lg 8 = 3 16 = 24 lg 16 = 4

• There are no algorithms that run faster than lg n time.

Previous slide

Next slide

Back to first slide

View graphic version