Faster division possible?
mura-admin opened this issue · 0 comments
mura-admin commented
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?