Implement a faster and unbiased version of list shuffling

[lehins]

Naive implementation using sorting lists is too slow. Here we add basic support of mutable boxed arrays and use it to implement Fisher-Yates shuffle algorithm that proves to be at least x20 more efficient

  shuffle
    uniformShuffleList:  OK (0.72s)
      5.43 ms ± 155 μs
    uniformShuffleListM: OK (0.21s)
      14.2 ms ± 818 μs
    naiveShuffleListM:   OK (0.92s)
      313  ms ± 5.7 ms

I thought about my implementation from #140 really hard and I could not release such naive implementation with a clear conscience. 🙂

Resolves #158