Asymptotic growth

rate is a measure of determining the b ehavior of the function with an increase in its arguments. Is use d especially frequently in the theory of computation, in order to describe the complexity of computation, ie depending on the quan tities required resources (such as time or memory) on the size of the input algorithm. Asymptotic growth rate describes how rapidly the function is increasing or decreasing, apart from the concrete form of these changes. To describe the asymptotic growth of the notation used big O and its modifications, m.

This template is also available as a WordPress theme at Free WordPress Themes.