time complexity
⏱️ 估算数据变大 10 倍时程序会慢多少倍
比如二分查找是极快的 $O(\log N)$,双层循环是 $O(N^2)$。
English
⏱️ Measures how runtime scales as input N grows (Big-O)
Asymptotic runtime efficiency notation.
代码示例
// O(log N) binary search探索 100 张双语词卡 →
比如二分查找是极快的 $O(\log N)$,双层循环是 $O(N^2)$。
⏱️ Measures how runtime scales as input N grows (Big-O)
Asymptotic runtime efficiency notation.
// O(log N) binary search探索 100 张双语词卡 →