CSCE 235

Light Bulb 11

April 28, 2004

In order for us to compare the efficiency of algorithms, we need to know some common growth rates, and how they compare to one another.

Let n be the size of input to an algorithm, and k some constant. The following are common rates of growth:

• Constant: , for example
• Linear:
• Logarithmic:
• :
• Quadratic:
• Polynomial:
• Exponential:

We then can use these to compare sorting, searching, and many other types of algorithms, allowing us to determine their efficiencies for optimization or refinement of our designs or solutions.

Based on Prof. Chuck Cusack’s Notes.