BILINGUAL WORD CARD · RANK 85

time complexity

⏱️ Measures how runtime scales as input N grows (Big-O)

Asymptotic runtime efficiency notation.

中文对照 · Chinese

⏱️ 估算数据变大 10 倍时程序会慢多少倍

比如二分查找是极快的 $O(\log N)$,双层循环是 $O(N^2)$。

Code example

// O(log N) binary search
Explore 100 bilingual word cards →