I'm just in the process of tidying up my comment by putting in some code that actually works, as opposed to that I first thought of! :-).
I think reversing the tests is probably enough proof; I don't believe separate scripts would prove anything extra.
I am using Benchmark to compare my results instead of using manual timing.
In reply to Re^4: performance of counting keys in a big hash
by space_monk
in thread performance of counting keys in a big hash
by xufengnju
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |