In [5]:
import numpy as np
%matplotlib inline
import matplotlib.pyplot as plt
import seaborn as sns
Write a function that computes the factorial of small numbers using np.arange
and np.cumprod
.
In [33]:
def np_fact(n):
"""Compute n! = n*(n-1)*...*1 using Numpy."""
LOL = np.arange(1, n+1, 1)
Factorial = np.cumprod(LOL)
if n == 0:
return 1
return Factorial[-1]
In [34]:
assert np_fact(0)==1
assert np_fact(1)==1
assert np_fact(10)==3628800
assert [np_fact(i) for i in range(0,11)]==[1,1,2,6,24,120,720,5040,40320,362880,3628800]
Write a function that computes the factorial of small numbers using a Python loop.
In [41]:
def loop_fact(n):
"""Compute n! using a Python for loop."""
if n == 0:
return 1
else:
Fact = 1
for x in range(1,n+1,1):
Fact = Fact*x
return Fact
In [42]:
assert loop_fact(0)==1
assert loop_fact(1)==1
assert loop_fact(10)==3628800
assert [loop_fact(i) for i in range(0,11)]==[1,1,2,6,24,120,720,5040,40320,362880,3628800]
Use the %timeit
magic to time both versions of this function for an argument of 50
. The syntax for %timeit
is:
%timeit -n1 -r1 function_to_time()
In [45]:
%timeit -n1 -r1 loop_fact(100000)
%timeit -n1 -r1 np_fact(100000)
In the cell below, summarize your timing tests. Which version is faster? Why do you think that version is faster?
np_fact is faster!!! WOO! This version is faster because the python lists has to deal with memory operations. It has to request the memory and access the memory. Whereas Numpy already has the memory/array. #IworkedwithPatrickonthis