深入理解python函数递归和生成器

def fact(n):#计算给定数字到一的乘积
   if n<=1:
     return 1
   else:
     return n * fact(n-1) 
print (fact(7))

def calc(n):
   print(n)
   if n/2 > 1:
     res = calc(n/2)
   return n
 calc(8)

8
4.0
2.0

def calc(n):
  print(n)
  if n/2 > 1:
    res = calc(n/2)
    print('res:',res)
  print("N:",n)
  return n
calc(8)

8
4.0
2.0
N: 2.0
res: 2.0
N: 4.0
res: 4.0
N: 8

def func():
  print('11111111')
  yield [1]
  print(2222222222)
  yield 2
  print(3333333333)
  yield 3

ret=func()
r1=ret.__next__()
print(r1)
r2=ret.__next__()
print(r2)
r3=ret.__next__()
print(r3)

11111111
[1]
2222222222
2
3333333333
3

def func():
  print('11111111')
  yield [1]
  print(2222222222)
  yield 2
  print(3333333333)
  yield 3
ret=func()
for i in ret:
  print(i)

def counter(start_at=0):
　　count = start_at
　　while True:
　　　　val = (yield count) if val is not None:
　　　　count = val
　　else:
　　　　count += 1

> count = counter(5)
> count.next()
5
> count.next()
6
> count.send(9)
9
> count.next()
10
> count.close()
> count.next()
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
StopIteration