When hashing random elements you expect to see a certain number of collisions in buckets. The second one in the bucket will be ordered after the first element. Therefore your algorithm is not a perfect shuffle, and the rising sequences test that I described in RE (tilly) 2: Randomize an array should be able to detect that.
But even so, I like it. :-)
In reply to RE (tilly): Hashing the order out of an array (Re: Randomize an array)
by tilly
in thread Randomize an array
by Zebu
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |