March 9, 2017
February 14, 2017
It’s running time is linear in the number of items and the difference between the maximum and minimum key values, so it is only suitable for direct use in situations where the variation in keys is not significantly greater than the number of items.
February 11, 2017
Based on the Fisher-Yates shuffle, the Knuth shuffle requires less overhead. FYS stimulates that you should remove a random item out of the original array and place it in a new array, and repeat while never fetching from the same location twice.
February 7, 2017
I needed to do this recently so I thought I would share my solution.