from multiprocessing import Pool import gevent,os import time def recursion(n): if n == 1 or n ==2: return 1 else: return recursion(n-1)+recursion(n-2) def f1(n): for i in range(1,n): print('%s递归运算'%i,recursion(i)) gevent.sleep(0.01) def f2(n): s = […