PDF Section II.5: Growth Rates of Functions - Dartmouth College

In view of Theorem II.5.8, the growth rate of log c n is the same irrespective of the value of constant c > 1. So we shall use log(n) to mean log c n for any constant c > 0. The most important base in growth rates is 2, and lg(n) is common notation for log2n. An algorithm with growth rate equal to or larger than exponential growth is called ................
................