Files
Sortieralgorythmen/turtlerekursion.py
T

32 lines
724 B
Python

import turtle
def draw_square(t, size):
for i in range(4):
t.forward(size)
t.right(90)
# draw_square(turtle, 100)
def draw_recursive_stairs(t, size, steps):
if steps == 0:
return
t.left(90)
t.forward(size)
t.right(90)
t.forward(size)
draw_recursive_stairs(t, size, steps - 1)
# draw_recursive_stairs(turtle, 20, 5)
def draw_recursive_tree(t, size, größe):
if größe == 0:
return
t.forward(size)
t.left(30)
draw_recursive_tree(t, size * 0.7, größe - 1)
t.right(60)
draw_recursive_tree(t, size * 0.7, größe - 1)
t.left(30)
t.backward(size)
turtle.left(90)
draw_recursive_tree(turtle, 100, 5)