الصفحة الرئيسية > Term: asymptotic space complexity
asymptotic space complexity
The limiting behavior of the use of memory space of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation.
- قسم من أقسام الكلام: noun
- المجال / النطاق: علم الكمبيوتر
- الفئة: Algorithms & data structures
- Government Agency: NIST
0
المنشئ
- GeorgeV
- 100% positive feedback