Time complexity - Wikipedia
6
公开标注数
6
参与人数
2026-07-20 10:10:26
首次 Whisper
本页的公开 Whisper
划选高亮2026-07-20 16:34:26
原文高亮摘录
“Algorithmic complexities are classified according to the type of function appearing in the big O notation.”
Whisper 随想笔记
So basically it's all about the shape of the function, not the actual numbers.
划选高亮2026-07-20 13:31:26
原文高亮摘录
“one commonly considers the worst-case time complexity, which is the maximum amount of time required for inputs of a given size.”
Whisper 随想笔记
I always forget average-case exists until someone asks for it in an interview.
划选高亮2026-07-20 13:22:26
原文高亮摘录
“one commonly considers the worst-case time complexity, which is the maximum amount of time required for inputs of a given size.”
Whisper 随想笔记
Worst-case is safe but sometimes too pessimistic—rare inputs can make it look bad.
划选高亮2026-07-20 10:28:26
原文高亮摘录
“the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm.”
Whisper 随想笔记
I always thought of it as the 'runtime' but this is more precise.
划选高亮2026-07-20 10:19:26
原文高亮摘录
“the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm.”
Whisper 随想笔记
But elementary operations aren't really fixed on real hardware...
划选高亮2026-07-20 10:10:26
原文高亮摘录
“the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm.”
Whisper 随想笔记
So it's basically just counting steps, right? Makes sense.
分享本页 Whisper
短链接
https://domwhisper.com/s/42fd5a8bce55嵌入代码
<iframe src="https://domwhisper.com/embed/42fd5a8bce55" width="100%" height="480" style="border:0;border-radius:16px" loading="lazy"></iframe>