|Perl: the Markov chain saw|
Re: (FASTER) Example of TMTOWTDIby gmax (Abbot)
|on Mar 22, 2002 at 10:01 UTC||Need Help??|
Your script saves time by skipping chomp. My addition will save time by avoiding a hidden join for each array interpolation. I found this trick when I was benchmarking anagram algorithms.
I used a 116_246 words dictionary, and I got a significative speed improvement, as you can see from the relative times.
BTW: ChOas, congratulations for your sanctification!
There is always room for improvement, though. ...
Combining the first array solution with the other tricks, we have a further 10% improvement.
I am afraid that I must have spoiled demerphq's comparison with my previous update. ;)
He very chivalrously included such update and compared the methods shown so far, offering an improvement, that was unfortunately slower than this array + concatenation hack.
Nice Job. Keep up the good work, bro, and many thanks for your analysis.
_ _ _ _ (_|| | |(_|>< _|