I see, indeed that makes totally sense, thanks for the clarification.
I still don't understand why we need to increase the index to increase our chances but there must be something I'm missing in the Fisher Yates' algorithm.
In this case only index 0 or 1 would be valid to come back but if we do $index + 1 instead then the possibile indexes for swapping are 0, 1 and 2.
This way we have more possible indexes that can be used to swap with the current item and more than that it also helps us to make the output a little more random during the shuffle since more indexes can be made available for the swap during each iteration.
I see, indeed that makes totally sense, thanks for the clarification.
I still don't understand why we need to increase the index to increase our chances but there must be something I'm missing in the Fisher Yates' algorithm.
Don't worry, that's a simple one too!
Imagine the following:
In this case only index 0 or 1 would be valid to come back but if we do
$index + 1instead then the possibile indexes for swapping are 0, 1 and 2.This way we have more possible indexes that can be used to swap with the current item and more than that it also helps us to make the output a little more random during the shuffle since more indexes can be made available for the swap during each iteration.
Thank you. That was a great explanation.
Anytime, glad to of been able to clear that up for you 😊. Thanks for your comments and for stopping by to read the article! 📚