Why does (i. >./) not seem a good candidate to you? On Aug 14, 2010 9:10 AM, "Zsbán Ambrus" <[email protected]> wrote:
On Fri, Aug 13, 2010 at 4:33 PM, Dan Bron <[email protected]> wrote: > When introducing J, we often point to... > A.&i.~ ! NB. For input N, produces all > permutations of order N (in l... I don't like this one, because it only really shows how the A. builtin is powerful and so it's obviously easy to use it for something like this. I don't really have a good candidate either though. There's the (i.>./) monad which finds the index of the maximal element. There's the (<./ .+~^:_) monad to compute shortest paths in an edge-weighted graph given by a matrix of distances (see "http://www.jsoftware.com/jwiki/Essays/Floyd";), but it's difficult to demonstrate with a test case. Ambrus ---------------------------------------------------------------------- For information about J forum... ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
