Torben.Bohnert/Sortieralgorithmen
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Turtle cleanup

Browse Source
This commit is contained in:
Panckiko11
2026-09-28 19:55:18 +02:00
parent 1c3f91aa83
commit 32d3f1ba5d
1 changed files with 25 additions and 46 deletions
Download Patch File Download Diff File Expand all files Collapse all files
theturdle.py
+27 -48
View File
@@ -9,55 +9,34 @@ t.left(90)
# turtle.forward(200) # turtle.forward(200)
# hexagon(6) # hexagon(6)
def stair(n): # def stair(n):
if n <= 0: # 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()
# def baum(n):
# if n < 0:
# return # return
# t.forward(20)
# t.left(90)
# t.forward(20)
# t.right(90)
# t.forward(n / 2) # stair(n - 1)
# t.left(30)
# baum(n - 1)
# t.right(60)
# baum(n - 1)
# t.left(30)
# t.backward(n / 2)
# turtle.tracer(False) # t.speed(10)
# # turtle.speed(0) # stair(100)
# baum(15)
# turtle.update()
# turtle.done() # turtle.done()
def baum(n):
if n < 0:
return
t.forward(n / 3)
t.left(30)
baum(n - 10)
t.right(60)
baum(n - 10)
t.left(30)
t.backward(n / 3)
turtle.tracer(False)
turtle.speed(0)
baum(150)
turtle.update()
turtle.done()