Asymptotic computational complexity

In computational complexity theory, asymptotic computational complexity is the use of asymptotic analysis for the estimation of computational complexity of algorithms and computational problems, commonly associated with the use of the big O notation.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.