Quote Originally Posted by savage
Has anyone done any benchmarks to see if this slightly changed version of the previous code is slightly faster, due to caching the result of the count-1 call?
I think it calculates the upper limit of the for cycle only once.