Anonymous user
Talk:Arbitrary-precision integers (included): Difference between revisions
Talk:Arbitrary-precision integers (included) (view source)
Revision as of 08:15, 14 February 2010
, 14 years ago→Use of external libraries: writing a bignum lib? feels like work...
(→Criteria for Non-Draft?: Whoops.) |
(→Use of external libraries: writing a bignum lib? feels like work...) |
||
Line 12:
:--[[User:Paddy3118|Paddy3118]] 16:21, 13 February 2010 (UTC)
: You might find [[Long multiplication]] interesting. Also, I'm almost certain I created a long division task, but I don't see it anywhere. A better way to ask for what you're looking for might be to ask for implementations of particular algorithms. I don't know the names of many relevant algorithms off-hand, though; perhaps some of the CS majors could chime in. --[[User:Short Circuit|Michael Mol]] 16:28, 13 February 2010 (UTC)
: Bignum engines are fairly large. I've just checked the Tcl sources, and our [http://math.libtomcrypt.com/ core bignum engine] is 4600 lines of [[C]] for just basic mathematical operations (division takes a lot it seems). OK, that includes comments but even so, it's all a bit much for RC. Given the general difficulty of writing a bignum implementation that doesn't suck, every language that provides built-in bignums will be using one of the existing libraries for it. –[[User:Dkf|Donal Fellows]] 08:15, 14 February 2010 (UTC)
== Criteria for Non-Draft? ==
| |||