are
the inputs to an algorithm whose time complexity is to
be determined. O(log n)=O(k)is the time the algorithm
takes for processing the input which are essenctially
the same.
You ask whether there are linear algorithms for
arbitrary precision base
conversion.
yes,I was asking
will take twice as long to process a 2 megabyte
integer, as it takes to process a 1 megabyte integer.
You ask whether there are linear algorithms for arbitrary precision base
conversion.
I seem to recall that Schonhage showed how to do base conversion with an
FTT along with his well-known fast
[EMAIL PROTECTED] ,good work!
--- Tim May [EMAIL PROTECTED] wrote:
On Wednesday, October 8, 2003, at 06:16 AM, Sarad
AV wrote:
hi,
If we are to convert a k-bit integer n to a base b
number,it takes us O(log n) if the base b is a
power
of 2.
eg. converting (1)base to base
On Wednesday, October 8, 2003, at 06:16 AM, Sarad AV wrote:
hi,
If we are to convert a k-bit integer n to a base b
number,it takes us O(log n) if the base b is a power
of 2.
eg. converting (1)base to base 16
0001
^^
1F in hex.
using a look up table.
Is there an algorithm
