[BangPypers] CPython's 'bignum' Implementation
amitsaha.in at gmail.com
Mon May 18 08:50:44 CEST 2009
On Mon, May 18, 2009 at 11:56 AM, Baishampayan Ghose <b.ghose at gmail.com> wrote:
> Thanks :) Since you are the one who asked the question, you can also
> accept my answer as the right answer for the question by clicking on
> the tick sign below the voting widget.
I know. My original question was already answered before you by a
couple of other folks!,
So, you will have to be content with my "Up" vote for now :)
> On 5/18/09, Amit Saha <amitsaha.in at gmail.com> wrote:
>> Hello Baishampayan,
>> On Sat, May 16, 2009 at 1:13 AM, Baishampayan Ghose <b.ghose at gmail.com>
>>>> Now, how does CPython implement bignum? From what I gather, there is
>>>> more than way of doing it- using a different radix (base), an array
>>>> of numbers. One hint is given by
>>>> http://www.python.org/dev/peps/pep-0237/. However, if any of you folks
>>>> know something concrete, I would appreciate it.
>>> I have given a cursory glance to the Python code base and I think I
>>> know how it's implemented :)
>>> My findings are here -
>>> I would appreciate a few up-votes if you deem my answer to be satisfying
>> I have given a +1 vote, I would have given one more, if SO allowed it.
>> But, Thanks!
>> Journal: http://amitksaha.wordpress.com
>> IRC: cornucopic on #scheme, #lisp, #math, #linux
>> "Recursion is the basic iteration mechanism in Scheme"
>> --- http://c2.com/cgi/wiki?TailRecursion
>> BangPypers mailing list
>> BangPypers at python.org
> Sent from my mobile device
> Baishampayan Ghose
> b.ghose at gmail.com
> BangPypers mailing list
> BangPypers at python.org
IRC: cornucopic on #scheme, #lisp, #math, #linux
"Recursion is the basic iteration mechanism in Scheme"
More information about the BangPypers