save project

diy2.py

-alist = [88, 75, 72, 82, 90, 85, 78, 91]
-n=len(alist)
-for i in range(0,n-1):
-    for j in range(0,n-1):
-        if alist[j]<alist[j+1]:
-            alist[j],alist[j+1]=alist[j+1],alist[j]
-print(alist)
+import turtle
+
+pen = turtle.Turtle()
+pen.color("sienna")
+w = turtle.Screen()
+w.bgcolor("wheat")
+ 
\ No newline at end of file
+pen.left(90)
+pen.up()
+pen.backward(150)
+pen.down()
+def tree(n):
+    if n >= 50:
+        pen.forward(n)
+        pen.right(30)
+        tree(n-50)
+        pen.left(60)
+        tree(n-50)
+        pen.right(30)
+        pen.up()
+        pen.backward(n)
+        pen.down()
+
+tree(100)
+turtle.done()
\ No newline at end of file