Timeline for What is the fastest algorithm for division of crazy large integers?
Current License: CC BY-SA 3.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5, 2015 at 7:50 | comment | added | user1084944 | @Tyler: ... and it obtains the remainder by first computing the quotient, and then subtracting off the appropriate multiple of the divisor. | |
| Jun 26, 2013 at 15:49 | vote | accept | Kosmo零 | ||
| Jun 26, 2013 at 15:34 | comment | added | tmyklebu |
BigInteger is a pretty bad thing to use if you want your operations to be fast. Multiplication and division are done schoolbook in the canonical implementation.
|
|
| Jun 26, 2013 at 15:33 | answer | added | tmyklebu | timeline score: 20 | |
| Jun 26, 2013 at 14:47 | review | Close votes | |||
| Jul 18, 2013 at 3:03 | |||||
| Jun 26, 2013 at 14:32 | comment | added | Kosmo零 | wikipedia doesn't answer on questions what the fastest one. I no need divisions that should be running for a days. | |
| Jun 26, 2013 at 14:29 | vote | accept | Kosmo零 | ||
| Jun 26, 2013 at 15:49 | |||||
| Jun 26, 2013 at 14:28 | comment | added | Tyler Durden | possible duplicate of Algorithm for dividing very large numbers | |
| Jun 26, 2013 at 14:24 | comment | added | Bernhard Barker | @Kosmos It should support as big a number as will fit into memory. But I was referencing it more as a starting point. Java's API code is open source, so you can look at how they did it. | |
| Jun 26, 2013 at 14:18 | comment | added | Tyler Durden | For generic questions like this you should be using the Wikipedia and coming here AFTER you have read the wikipedia and tried something. | |
| Jun 26, 2013 at 14:17 | comment | added | Tyler Durden | The OP does not say he is using Java. Java's implementation of arbitrary precision math is relatively inefficient, but could handle billions of digits if you had enough memory. It would take a long time to compute the quotient. | |
| Jun 26, 2013 at 14:12 | comment | added | Kosmo零 | Could Java's BigInteger handle gigs of bytes? | |
| Jun 26, 2013 at 14:12 | answer | added | Tyler Durden | timeline score: 13 | |
| Jun 26, 2013 at 14:00 | comment | added | Tyler Durden | Barrett reduction calculates a modulus, not a quotient. | |
| Jun 26, 2013 at 14:00 | comment | added | Bernhard Barker | Something like Java's BigInteger? | |
| Jun 26, 2013 at 13:59 | history | edited | Tyler Durden | CC BY-SA 3.0 |
clarified question and improving phrasing
|
| Jun 26, 2013 at 12:23 | comment | added | Regenschein | en.wikipedia.org/wiki/Barrett_reduction | |
| Jun 26, 2013 at 12:10 | history | asked | Kosmo零 | CC BY-SA 3.0 |