Index

Logarithms

Some basic notation:

Useful identities:

We say that a function f is polyalgorithmically bound if f(x) = lgO(1)x. Since logxz = k logyz for some k, we usually use base 2 for the big O notation, i.e.

	  O(logxz) = O(logyz) = O(lg z).
	

Note that any polynomial function grows faster than any polyalgorithmic function.

References

T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms. MIT Press, 1990.

Index