Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial

Asymptotic Computational Complexity - What is the function asymptotic complexity?


Knowing how a function f(n) increases as 'n' gets large is essentially asymptotic behavior of that function (e.g., f(n)=c*n or f(n)=c*n2, etc.). The ability to predict how well a program will handle big inputs is why this is so important.