High Quality Content by WIKIPEDIA articles! In computer science and applied mathematics, particularly the analysis of algorithms, asymptotic analysis is a method of describing limiting behavior. Examples include the performance of algorithms when applied to very large input data, or the behavior of physical systems when they are very large. The simplest example is when we have a function f(n) and wish to describe its properties when n becomes very large. Thus, if f(n) = n2+3n, the term 3n becomes insignificant compared to n2 when n is very large. We say that "f(n) is asymptotically equivalent to n2 as n ? ?" and write f(n) ~ n2.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.