I am currently doing without a proper computer and using unfamiliar mail
software that is making it difficult for me to follow the J forums. Someone
recently mentioned my text (appreciated) but I believe it referred to the 3rd
edition of the book (J6.02). The current edition is the fourth editio
Sorry. Shooting from the hip as usual!
Mike
Please reply to mike_liz@tiscali.co.uk.
Sent from my iPad
> On 20 Nov 2017, at 11:44, Erling Hellenäs wrote:
>
> There is no key operation in this published version. /Erling
>
>
>> Den 2017-11-20 kl. 12:20, skrev 'Mike Day' via Programm
There is no key operation in this published version. /Erling
Den 2017-11-20 kl. 12:20, skrev 'Mike Day' via Programming:
Yes, the char array uses less space. Also, as has been observed before, the
main work is deriving the “RGFs” and there’s a considerable overhead in
turning them into
(it's kind of silly, though, since in real life you'd just use i.)
Thanks,
--
Raul
On Mon, Nov 20, 2017 at 6:27 AM, Raul Miller wrote:
> Note also that the 256 parMD 256 case could have been addressed by
> using |. instead of }. when defining a
>
> Thanks,
>
> --
> Raul
>
>
> On Mon, Nov 20,
Note also that the 256 parMD 256 case could have been addressed by
using |. instead of }. when defining a
Thanks,
--
Raul
On Mon, Nov 20, 2017 at 6:20 AM, 'Mike Day' via Programming
wrote:
> Yes, the char array uses less space. Also, as has been observed before,
> the main work is derivi
Yes, the char array uses less space. Also, as has been observed before, the
main work is deriving the “RGFs” and there’s a considerable overhead in
turning them into their partition equivalents. Try removing the key operation.
Mike
Please reply to mike_liz@tiscali.co.uk.
Sent f
Hi all!
I made a comparison.
They are very similar in theirtime requirements, but Mike Days version
uses considerably less space.
This might be mainly due to the choice of ascii representation of theresult.
Some consequences of this choice:
x=:15
y=:15
x parMD y
0123456789:;<=>
Hi all !
You can do it in two steps? Find all combinations, then all permutations
of each combination?
perm=: (A.~i.@!@#)
combbit=: 4 : 0
or=. 23 b.
lshift=. 33 b.
lrot=. 32 b.
shift=. 2 ((_2 lrot 2 | [) or _1 lshift ])/\ ]
n=. <:##:_1 (32 b.) 1
l=. >.y%n
p=. y->:i.>:d=.y-x
k=. <"_1(<.p%n)|."
A really quick hack at the problem gave me this
sper=:>@(#~(-: ~.)@>)@,@{@($ <@i.)
3 sper 4
0 1 2
0 1 3
0 2 1
0 2 3
0 3 1
0 3 2
1 0 2
1 0 3
1 2 0
1 2 3
1 3 0
1 3 2
2 0 1
2 0 3
2 1 0
2 1 3
2 3 0
2 3 1
3 0 1
3 0 2
3 1 0
3 1 2
3 2 0
3 2 1
2 sper 4
0 1
0 2
0 3
1 0
1 2
1 3
2 0
2 1
2 3
3 0
3 1
