Đệ quy (Recursion)

def recursive_function(n):
    # Base case - Điều kiện dừng
    if n <= 0:
        return result
    
    # Recursive case
    return recursive_function(n - 1)

fun recursiveFunction(n: Int): Int {
    // Base case
    if (n <= 0) return result
    
    // Recursive case
    return recursiveFunction(n - 1)
}

int recursiveFunction(int n) {
  // Base case
  if (n <= 0) return result;
  
  // Recursive case
  return recursiveFunction(n - 1);
}

func recursiveFunction(_ n: Int) -> Int {
    // Base case
    if n <= 0 { return result }
    
    // Recursive case
    return recursiveFunction(n - 1)
}

int recursiveFunction(int n) {
    // Base case
    if (n <= 0) return result;
    
    // Recursive case
    return recursiveFunction(n - 1);
}

def factorial(n):
    if n <= 1:
        return 1
    return n * factorial(n - 1)
 
print(factorial(5))  # 120

fun factorial(n: Int): Long {
    if (n <= 1) return 1
    return n * factorial(n - 1)
}
 
println(factorial(5))  // 120

int factorial(int n) {
  if (n <= 1) return 1;
  return n * factorial(n - 1);
}
 
print(factorial(5));  // 120

func factorial(_ n: Int) -> Int {
    if n <= 1 { return 1 }
    return n * factorial(n - 1)
}
 
print(factorial(5))  // 120

long factorial(int n) {
    if (n <= 1) return 1;
    return n * factorial(n - 1);
}
 
System.out.println(factorial(5));  // 120

from functools import lru_cache
 
@lru_cache(maxsize=None)
def fib(n):
    if n <= 1:
        return n
    return fib(n - 1) + fib(n - 2)

val memo = mutableMapOf<Int, Long>()
 
fun fib(n: Int): Long {
    if (n <= 1) return n.toLong()
    return memo.getOrPut(n) { fib(n - 1) + fib(n - 2) }
}

Map<int, int> memo = {};
 
int fib(int n) {
  if (n <= 1) return n;
  if (memo.containsKey(n)) return memo[n]!;
  memo[n] = fib(n - 1) + fib(n - 2);
  return memo[n]!;
}

var memo = [Int: Int]()
 
func fib(_ n: Int) -> Int {
    if n <= 1 { return n }
    if let cached = memo[n] { return cached }
    memo[n] = fib(n - 1) + fib(n - 2)
    return memo[n]!
}

Map<Integer, Long> memo = new HashMap<>();
 
long fib(int n) {
    if (n <= 1) return n;
    if (memo.containsKey(n)) return memo.get(n);
    long result = fib(n - 1) + fib(n - 2);
    memo.put(n, result);
    return result;
}