Justin, You might look at the following link for some comparisons. Not exactly this link, but ones in the same domain.
http://rosettacode.org/wiki/Playing_Cards#J On Sun, Feb 27, 2011 at 11:25 AM, Justin Paston-Cooper <[email protected]> wrote: > Dear All, > > I've asked quite a few questions here regarding projects which I've > been trying to solve with J. A lot of my attempts have turned out to > be rather slow, and I've been given many useful tips and wholly > shorter and better ways to solve my problems. I've been told on > occasion that the way I've been trying to solve things doesn't lend > itself well to J's being array-based. A lot of what I've tried to use > J for has involved trees, like trying to generate game trees for card > games, or to generate all elements of a mathematical group. I was > doing these things with stacks and boxed elements and this turned out > to be rather slow. Is there some resource that deals with common > algorithms and their implementations in J? Maybe it shows bad ways to > do things as well, for comparison. Thanks in advance for your advice. > -- (B=) ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
