Summary - Factorial

Compute and print a number's factorial in a mini task.

In this group you learned the factorial definition, recursive and iterative solutions and base case selection. Both methods are O(n).

The recursive solution is readable but uses O(n) memory. The iterative solution is more efficient with O(1) memory.

Exercise Full factorial

Write factorial_full(n). Compute recursively. Print 720 with print(factorial_full(6)).

Show example solution

def factorial_full(n):
    # Full factorial
    if n <= 1:
        return 1
    return n * factorial_full(n - 1)
print(factorial_full(6))