/test2/timing3.py

http://gmpy.googlecode.com/ · Python · 27 lines · 23 code · 4 blank · 0 comment · 1 complexity · b9d4f9908f894107f83f92e2a0187f76 MD5 · raw file

  1. import gmpy2 as _g
  2. import time
  3. print "Typical expected results would be:","""
  4. D:\PySym>python timing.py
  5. Factorial of 10000 took 0.0619989238859 (35660 digits)
  6. Fibonacci of 10000 took 0.000744228458022 (2090 digits)
  7. Factorial of 100000 took 4.44311764676 (456574 digits)
  8. Fibonacci of 100000 took 0.022344453738 (20899 digits)
  9. Factorial of 1000000 took 152.151135367 (5565709 digits)
  10. Fibonacci of 1000000 took 0.670207059778 (208988 digits)
  11. """
  12. print "Actual timings and results...:"
  13. for i in (10000,100000,1000000):
  14. start=time.clock()
  15. x=_g.fac(i)
  16. stend=time.clock()
  17. print "Factorial of %d took %s (%d digits)" % (
  18. i, stend-start, x.num_digits())
  19. start=time.clock()
  20. x=_g.fib(i)
  21. stend=time.clock()
  22. print "Fibonacci of %d took %s (%d digits)" % (
  23. i, stend-start, x.num_digits())