Good catch. >an upper bound on the total number of steps is tot = x + y*z I think this should be x + z**y, since the y loops could be nested, but the basic ar

Good catch. >an upper bound on the total number of steps is tot = x + y*z I think this should be x + z**y, since the y loops could be nested, but the basic argument that there is a finite upper bound is sound.