[dilippkumar]

How far does this analogy go?

For example, if I plot how long both programs take at various scales, at some point I should be able to determine which one is O(n log(n)) right?

[DannyBee]

I gave the formal definition of distinguishability in the other comment, but it does not include running time.