Skip to content

⚡ Optimize array shuffle with Fisher-Yates algorithm #15

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
walsoup wants to merge 1 commit into
base: main
Choose a base branch
from

Replace inefficient sort shuffle with Fisher-Yates algorithm

f13cd0e
Select commit
Loading
Failed to load commit list.
Open

⚡ Optimize array shuffle with Fisher-Yates algorithm #15

Replace inefficient sort shuffle with Fisher-Yates algorithm
f13cd0e
Select commit
Loading
Failed to load commit list.

Select a check to view from the sidebar