We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
I think we can at least double the speed of the near prime searching.
-O3
But first we need a benchmark or two so we know how much faster we are actually getting if we make these changes.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
I think we can at least double the speed of the near prime searching.
-O3
.But first we need a benchmark or two so we know how much faster we are actually getting if we make these changes.
The text was updated successfully, but these errors were encountered: