This repository was archived by the owner on Sep 30, 2020. It is now read-only.
Fix shuffle algorithm for friends page#1222
Open
Mortal wants to merge 1 commit intorust-lang:masterfrom
Open
Conversation
Implement Fisher-Yates shuffle [1] to ensure that each random permutation is equally likely to be produced. The algorithm "repeatedly pick two random indices i and j between 0 and N-1 and swap element i and j" is a simple, straightforward algorithm, but unfortunately it tends to produce some random orderings more frequently than others. There is an equally simple algorithm by Fischer and Yates that does not have the same problem: "for i = 0 to N-1, pick a random index j between 0 and i and swap element i and j". [1]: https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle
|
Thanks for the pull request, and welcome! The Rust team is excited to review your changes, and you should hear from @ashleygwilliams (or someone else) soon. If any changes to this PR are deemed necessary, please add them as extra commits. This ensures that the reviewer can see what has changed since they last reviewed the code. Due to the way GitHub handles out-of-date commits, this should also make it reasonably obvious what issues have or haven't been addressed. Large or tricky changes may require several passes of review and changes. Please see the contribution instructions for more information. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
3 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Implement Fisher-Yates shuffle to ensure that each random permutation is equally likely to be produced.
The algorithm "repeatedly pick two random indices i and j between 0 and N-1 and swap element i and j" is a simple, straightforward algorithm, but unfortunately it tends to produce some random orderings more frequently than others. There is an equally simple algorithm by Fischer and Yates that does not have the same problem: "for i = 0 to N-1, pick a random index j between 0 and i and swap element i and j".