JCM on Nostr: If you are determining big O complexity, it doesn't really matter, because the access ...

If you are determining big O complexity, it doesn't really matter, because the access time is basically bounded by a constant regardless of n and access pattern (we could argue about it being different on *weird* custom architectures, but then we also have to consider lots of other stuff we don't wanna).


If you're trying to estimate the *real* duration an algorithm will take, it's a different story of course. :P