From: Robert Dewar <robert_dewar@my-deja.com>
Subject: Re: number bases
Date: 1999/11/02
Date: 1999-11-02T00:00:00+00:00 [thread overview]
Message-ID: <7vmkk2$peq$1@nnrp1.deja.com> (raw)
In-Reply-To: 860624474wnr@diphi.demon.co.uk
In article <860624474wnr@diphi.demon.co.uk>,
jpt@diphi.demon.co.uk wrote:
where the radix
> used for the dividend and divisor could be anywhere between 2
and 45_000
> (radix**2 has to be less than Max_Int). I tried it with a few
different
> values, and the clear winner on speed was a radix of 256. (I
don't know
> about storage). This was Gnat 3.10 on Win95.
Of course the efficient way to do multiple precision on
a machine with k-bit words is to use a radix of 2**k, but
higher level languages make this approach hard. Multiple
precision integer arithmetic is one of the few things I
know that is FAR easier to program in machine language than
in typical high level languages (which do not give convenient
access to the necessary primitives, namely the carry flag, and
double length products and dividends).
Sent via Deja.com http://www.deja.com/
Before you buy.
next prev parent reply other threads:[~1999-11-02 0:00 UTC|newest]
Thread overview: 10+ messages / expand[flat|nested] mbox.gz Atom feed top
1999-11-01 0:00 number bases G
1999-11-01 0:00 ` tmoran
1999-11-02 0:00 ` Robert Dewar
1999-11-02 0:00 ` tmoran
1999-11-01 0:00 ` Robert Dewar
1999-11-01 0:00 ` Ted Dennison
1999-11-01 0:00 ` JP Thornley
1999-11-02 0:00 ` Robert Dewar [this message]
1999-11-02 0:00 ` Daryle Walker
1999-11-03 0:00 ` Robert Dewar
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox