TimeComplexity - Python Wiki

This page documents the time-complexity (aka "Big O" or "Big Oh") of various operations in current CPython. Other Python implementations (or older or still-under development versions of CPython) may have slightly different performance characteristics. However, it is generally safe to assume that they are not slower by more than a factor of O(log n). Generally, 'n' is the number of elements current

[teppey]

計算量

[yag_ays]

“This page documents the time-complexity (aka "Big O" or "Big Oh") of various operations in current CPython.”

[mooz]

CPython に置ける様々な操作の計算量.