Commit 20fc9bb3 by BellCodeEditor

save project

parent 7dc66cad
Showing with 45 additions and 7 deletions
def sum_numbers(num):
if num == 1:
return 1
temp=sum_numbers(num-1)
return num+temp
result = sum_numbers(100)
print(result)
\ No newline at end of file
...@@ -2,9 +2,8 @@ import time ...@@ -2,9 +2,8 @@ import time
s_t=time.time() s_t=time.time()
list1 = [] list1 = []
print(s_t) for a in range(0,100):
for a in range(0, 1000): for b in range(0,10000):
for b in range(0, 1000): list1.insert(0,0)
list1.insert(0, 0)
e_t=time.time() e_t=time.time()
print(e_t-s_t) print(e_t-s_t)
\ No newline at end of file
import turtle
import random
pen = turtle.Turtle()
pen.color("sienna")
w = turtle.Screen()
w.bgcolor("wheat")
pen.left(90)
pen.up()
pen.backward(150)
pen.down()
def tree(n):
if n>=0:
pen.pensize(n/10)
pen.forward(n)
a = random.randint(0,25)
b = random.randint(1,25)
pen.right(a)
tree(n-b)
pen.left(2*a)
tree(n-b)
pen.right(a)
pen.up()
pen.backward(n)
pen.down()
tree(100)
turtle.done()
\ No newline at end of file
a=[12,17,26,15,29,100000000000000000000000000000000000000000000000000] a=[15,21,9,14,24,18]
for i in range(0,5): for i in range(0,5):
for j in range(0,5): for j in range(0,5):
if a[j]>a[j+1]: if a[j]>a[j+1]:
a[j],a[j+1]=a[j+1],a[j] a[j],a[j+1]=a[j+1],a[j]
print(a) print(a)
n=len(a)
print(n)
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or sign in to comment