save project

diy1.py

-alist=[22,33,43,2,342,32142,2665,4,55665,3423,2456,22342]
-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)
\ No newline at end of file
+def tree(n):
+    if n>=50:
+        pen.forward(n)
+        pen.right(30)
+        
\ No newline at end of file