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.

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

Jump to bottom

Faster division possible? #44

Open
mura-admin opened this issue Aug 4, 2018 · 0 comments
Open

Faster division possible? #44

mura-admin opened this issue Aug 4, 2018 · 0 comments

Comments

@mura-admin
Copy link

I just instrumented my code and BigInt division seems to be a bottleneck with 32 byte division. Wondering if it's possible to use a faster algorithm? A quick google returns some promising results:

http://bioinfo.ict.ac.cn/~dbu/AlgorithmCourses/Lectures/Hasselstrom2003.pdf
https://en.wikipedia.org/wiki/Division_algorithm#Large-integer_methods

Have you benchmarked alternatives previously?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@mura-admin