Files
Sortieralgorithmen/theturdle.py
T
2026-09-22 10:15:22 +02:00

42 lines
654 B
Python

import turtle
t = turtle.Turtle()
# def hexagon(n):
# for i in range(n):
# turtle.right(120)
# turtle.forward(200)
# hexagon(6)
# def stair(n):
# if n <= 0:
# return
# turtle.forward(20)
# turtle.left(90)
# turtle.forward(20)
# turtle.right(90)
# stair(n - 1)
# turtle.speed(10)
# stair(100)
# turtle.done()
t.left(90)
def baum(length, n):
if n <= 0:
return
t.forward(length)
t.right(45)
t.forward(length // 1.1)
t.right(180)
t.forward(length // 1.1)
t.right(90)
t.forward(length // 1.1)
return n * baum(n - 1)
baum(50, 10)
turtle.done()