Informatik

Nikokaushaus

Treppe

public void treppe(double x, int n) {

for (int i=1;i<=n;i++) {
 turtle.forward(x);
 turtle.right(90);
 turtle.forward(x);
 turtle.left(90);
}
 turtle.right(180);
 turtle.forward(x*n);
 turtle.right(180);
 turtle.forward(x*n);

}