Skip to main content
Software Engineering

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

13
  • 5
    find a existing bigInt divide and optimize for your case? Commented Jul 15, 2015 at 15:30
  • 3
    Java's digs down to "Uses Algorithm D in Knuth section 4.3.1. Many optimizations to that algorithm have been adapted from the Colin Plumb C library" (from here) Commented Jul 15, 2015 at 15:38
  • 1
    ... I assume you looked at the code in BigInteger that I linked above. Is there a reason that didn't work for you? Commented Jul 28, 2015 at 19:40
  • 1
    I'd like to point out that you are (likely) a math or cs phd student (according to your SE profile). Programmers.SE tends to be the much more pragmatic industry programmers rather than the designers of new algorithms or deep understanding of existing ones. If its in the standard library - there are other problems and deadlines to be had rather than worrying about reimplemeting the wheel (until the profiler says that its not rolling fast enough). You might have better luck asking on CS.SE or TCS.SE. Commented Jul 28, 2015 at 19:55
  • 2
    Is the problem in efficient unpacking the 26-bit words? Commented Jul 28, 2015 at 19:56