int factorial(int n) {
    if (n <= 1) {
        return 1; // base case — stops the recursion
    }
    return n * factorial(n - 1); // recursive case
}
