See how FlowPaste makes code sharing beautiful
A classic recursive example
// Example: Fibonacci Function
function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
}
const result = fibonacci(10);
console.log(result); // 55A recursive function that calculates Fibonacci numbers. The function calls itself twice per iteration, creating an exponential time complexity.