next up previous
Next: Theta Up: CSE 2320: Algorithms and Previous: CSE 2320: Algorithms and

Growth of Functions

Definition: The efficiency of an algorithm is the order of growth of the algorithm as the input size approaches the limit (increases without bound).

The asymptotically more efficient algorithm is usually the better choice for all but small inputs.

Plot asymptotic growths

Copyright © 1998 The University of Texas at Arlington