Rosetta Code

Factorial

Compute factorial values both recursively and iteratively, well past the 64-bit range.

Edit the source, then Run. Checks start after your first Run. Ctrl/⌘ + Enter runs; Tab indents. Preview services use sample data and never contact a real service.

Sourcerosettacode/popular/factorial.vibe
def recursive_factorial(n: int) -> int
  if n <= 1
    1
  else
    n * recursive_factorial(n - 1)
  end
end

def iterative_factorial(n: int) -> int
  result = 1
  value = 2
  while value <= n
    result = result * value
    value = value + 1
  end
  result
end

def run -> { iterative_50: int, recursive_10: int, recursive_25: int }
  {
    recursive_10: recursive_factorial(10),
    recursive_25: recursive_factorial(25),
    iterative_50: iterative_factorial(50)
  }
end

Output

Click Run example to see the result.

Code checks

Run once to load the checker. Your code stays in this browser.