The order of growth of an algorithm is an approximation of the time it would take to run as the input size N increases.