NB. Oh! j implements antibase as
NB. "insert divmod" from right to left.
COINS =: 2 5r2 2 5
Dyad =: [: :
divmod =: foo =: <.@:%~ , |
antibaseJ =: }.@:(((divmod {.) , }.@:])/@:,)"1 0 Dyad
COINS antibaseJ 38
1 1r2 1 3
NB. I had envisioned a left-to-right algorithm
a
A recent thread moved to chat, "more fork examples", looks at timings
for high powers of BIGNUMs. The following suggests a speedup is possible
(at least in J6.02, to which I'm restricted until my life settles down - sorry!)
--
Same here
ts 'p0=: 9223372036854775807x ^ 1'
16.509273 5436416
ts 'p1=: 9223372036854775807x intpower 1'
5.9769485 1710080
JVERSION
Engine: j701/2011-01-10/11:25
Library: 8.01.016
Qt IDE: 1.0.22/4.8.5
Platform: Win 64
Installer: j801 beta install
R.E. Boss
(Add your info to
Perhaps you would like a bowl for your omelette?
' #'{~ ((i.-10) >/ (]^2:)) i:3j20
###
###
#
#
###
#
###
#
###
Thanks,
--
Raul
On Fri, Jan 24, 2014 at
Nice bowl!
Linda
-Original Message-
From: [email protected]
[mailto:[email protected]] On Behalf Of Raul Miller
Sent: Monday, January 27, 2014 10:41 PM
To: Programming forum
Subject: Re: [Jprogramming] A SAD STORY
Perhaps you would like a b
Repeated squaring (from
http://www.jsoftware.com/jwiki/Essays/Repeated%20Squaring ) is as fast but
twice as fat as intpower
ts'pr=:9223372036854775807x (4 : ''*/ *~^:(I.|.#:y) x'') 1'
5.9712462 3560960
R.E. Boss
(Add your info to http://www.jsoftware.com/jwiki/Community/Demographics )
>
