Skip to content
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.

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

Speed up printing of large permutations #3740

Merged
merged 3 commits into from
Nov 14, 2019

Commits on Nov 13, 2019

  1. Configuration menu
    Copy the full SHA
    a9d1bb1 View commit details
    Browse the repository at this point in the history
  2. Speed up converting permutations to strings

    Remove old O(n^2) algorithm with O(n) algorithm
    ChrisJefferson committed Nov 13, 2019
    Configuration menu
    Copy the full SHA
    ff4c134 View commit details
    Browse the repository at this point in the history
  3. Speed up Printing permutations

    Replace old O(n^2) algorithm with O(n) one, because unlike the
    comment, we are no longer limited to 9600 baud and can produce some
    large permutations
    ChrisJefferson committed Nov 13, 2019
    Configuration menu
    Copy the full SHA
    b12bffe View commit details
    Browse the repository at this point in the history