Timing results are a poor substitute to O(N) complexity estimates. I mean, does a method take longer because it's doing lots of virtual memory stuff or because

Timing results are a poor substitute to O(N) complexity estimates. I mean, does a method take longer because it's doing lots of virtual memory stuff or because it uses a lot of computron?