Apr

05

## APL Hacking: Project Euler (#22)

Problem 22 [http://projecteuler.net/index.php?section=problems&id=22]:
∇R←PETWENTYTWO NAMES;X
⍝ Receiving a 1×N

Apr

05

Problem 22 [http://projecteuler.net/index.php?section=problems&id=22]:
∇R←PETWENTYTWO NAMES;X
⍝ Receiving a 1×N

Mar

31

Problem #21 [http://projecteuler.net/index.php?section=problems&id=21]:
∇R←PETWENTYONE;X;Y;Z
⍝ Compute the sum

1 min read

Mar

30

I was avoiding this one for a while simply because I wanted to have a better
carry algorithm in mind.

1 min read

Mar

28

I didn't really have a good idea of how to solve this one until I started
playing around

1 min read

Mar

25

Eric gave a talk today about the Connection Machines and CM Lisp. One of the
examples was of a way

1 min read

Mar

23

You notice that these are not daily anymore. :)
For this one, I took advantage of the ability to rotate vectors

Mar

21

This one I did the old fashioned way at first, with a loop and a lot of cases
and branching.

1 min read

Mar

16

For this problem, I could have reused my CARRY function from before, but it
seemed like it would only make

1 min read

Mar

15

This was a problem to find all of the forward searching paths in a 20 by 20
grid. This is

1 min read

Mar

14

This problem was interesting in all different ways. It asks for Collatz Sequence
counts. First, I tried to do the

2 min read