Devon McCormick wrote: > > It is an interesting picture but the pseudo-code falls short of fully > describing the alogrithm. The core of it is as follows (where "counter" > is > a prime): > > let x = mod(counter,11); > > if(x=1) move position up; > else if(x=2) move position down; > else if(x=3) move position right; > else if(x=4) move position left; > else if(x=5) move position up; > > increment colour of pixel at position; > > Besides illustrating the unnecessary wordiness of even conventional > pseudo-code, it fails to specify what happens for the cases where x has > the > values six through ten (and zero). > [...] > I'd say that the pseudo-code specifies that in these cases no motion takes place, thus the increment is made at the current position, then cycle repeats with the next prime.
-- View this message in context: http://old.nabble.com/Prime-number-nebula-tp27062900s24193p27065905.html Sent from the J Chat mailing list archive at Nabble.com. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
