sg=. +./@:*."1/~@#:@i. sg 256 viewmat sg 256
On Sat, Nov 5, 2011 at 1:50 PM, mikel paternain <[email protected]> wrote: > > > > In the amazing book Chaos and Fractals New frontiers of Science, the authors > described a simple algorithm for making the Sierpinski Gasket. This is > perhaps the most short and efficient algorithm (in non tacit programming > languages) for computing this fractal. > The basic algorithm is(in pseudocode): > > Define x,y > For y=0 to 255 > For x=0 to 255 > If /x And y)=0 Then Pset(x,y) //Pset is a function for drawing the > point x,y > Next x > Next y > End > > With my little experience inJ the question is how translate this code to J . > Help me please! > Thanks in advance!! > > Mikel > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
