1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
class Cons:
def __init__(self, value, next):
self.value = value
self.next = next
def create(len):
if len > 0:
return Cons(len, create(len - 1))
else:
return None
def append(a, b):
if a is None:
return b
else:
return Cons(a.value, append(a.next, b))
def reverse(a):
if a is None:
return None
else:
return append(reverse(a.next), Cons(a.value, None))
def output(a):
result = ""
while not a is None:
result = result + " " + str(a.value)
a = a.next
return result
import sys, time
sys.setrecursionlimit(3100)
# print(output(create(10)))
# print(output(reverse(create(10))))
# takes about 39s
def test():
start = time.time()
reverse(create(3000))
print("Total time: {}".format(time.time() - start))
for i in range(100):
test()
|
