Factorial

// Recursive implementation of n! (n-factorial) calculation
int factorial(int n) {
    // Base case: n = 0 or 1
    if (n <= 1) {
        return 1;
    }
    // Recursive case: n! = n * (n - 1)!
    return n * factorial(n - 1);
}```

// Recursive implementation of n! (n-factorial) calculation
public class Factorial {
    
    public static int factorial(int n) {
 
        // Base case: n = 0 or 1
        if (n <= 1) {
            return 1;
        }
 
        // Recursive case: n! = n * (n - 1)!
        return n * factorial(n-1);
    }
}```

function factorial(n) {
  if (n <= 1) {
    return 1;
  }
  return n * factorial(n - 1);
}
console.log(factorial(5));```

# Recursive implementation of n! (n-factorial) calculation
def factorial(n):
    # Base case: n = 0 or 1
    if n <= 1:
        return 1
 
    # Recursive case: n! = n * (n - 1)!
    return n * factorial(n - 1)```