Skip to content

use a faster shuffle algorithm #3

Description

@semibran

The sort shuffle method is considered bad practice when compared to the standard Fisher-Yates (an O(n log n) vs. O(n) time difference), and should ideally be replaced.

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions