首页 >  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.

0 0

创建者

  • GeorgeV
  •  (Gold) 1123 分数
  • 100% positive feedback
© 2024 CSOFT International, Ltd.