DSA 22: Recursion - Factorial [Part 3]

Base-Case
data structures
algorithms
Author

Tony Phung

Published

February 4, 2025

def factorial(nbr: int):
    if nbr == 1:    # base-case
        return 1    # factorial(1) 
    else:           # recursive-case
        return nbr * factorial(nbr-1)
import math
for i in range(1,10):
    print(f"tony_vs_mathlib: [{factorial(i)}] vs [{math.factorial(i)}]")
tony_vs_mathlib: [1] vs [1]
tony_vs_mathlib: [2] vs [2]
tony_vs_mathlib: [6] vs [6]
tony_vs_mathlib: [24] vs [24]
tony_vs_mathlib: [120] vs [120]
tony_vs_mathlib: [720] vs [720]
tony_vs_mathlib: [5040] vs [5040]
tony_vs_mathlib: [40320] vs [40320]
tony_vs_mathlib: [362880] vs [362880]