Home > Term: asymptotic time complexity
asymptotic time complexity
The limiting behavior of the execution time of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation.
- Kalbos dalis: noun
- Pramonės šaka / sritis: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Kūrėjas
- GeorgeV
- 100% positive feedback