If you worry about performance rather use a shuffle approach.
Or use the fact that the order of keys in a hash is random.
In reply to Re^2: Trying to get sum of elements in array
by LanX
in thread Trying to get sum of elements in array
by Hayest
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |