News for hackers. Stuff that matters.
Re:WTF Is Big O Notation? by anon946 on Monday March 25, 2019 @10:10PM (#19488707)
Well, it's "wrong", but there's the saying that all models are wrong, but some are useful. If time complexity analysis had to include physical distance, then it would perhaps be less wrong, but also much less useful.

That said, "time complexity" is a bit of a misnomer anyway. It's often implied, but underneath, there is a specific operation. For example, when we say that merge sort is O(N lg N), we mean in number of comparison operations.

There are no comments on this comment yet.