I have a C list and an N list with C a non-linear function of N, linked by a parameter F, the value of which would be different for each pair of C and N.
I have been finding the value of F by (C,: N ) verb_function_of_F ^:_ (start value of F). Inside the verb, I assign C and N to the appropriate values in the equation and let the verb iterate to find the solution for each pair of C and N. If the C and N lists are, say, 15 items each, does the interpreter continue to iterate until the solution of all pairs is found or is it smart enough to stop iterating for pairs for which the solution has been found and continue on for the others? I suspect the former. If so, how can I improve the efficiency of the iteration? I presume that I have to use the rank conjunction but am unsure how to apply it to the appropriate pairs of C and N. Bob ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
