Rosetta Code

Fraction reduction

Reduce sample fractions to lowest terms with Euclid's algorithm.

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/fraction_reduction.vibe
def gcd(a: int, b: int) -> int
  left = a.abs
  right = b.abs

  while right != 0
    remainder = left % right
    left = right
    right = remainder
  end

  left
end

def reduce_fraction(numerator: int, denominator: int) -> { denominator: int, numerator: int }
  divisor = gcd(numerator, denominator)
  reduced_numerator = numerator // divisor
  reduced_denominator = denominator // divisor

  if reduced_denominator < 0
    reduced_numerator = -reduced_numerator
    reduced_denominator = -reduced_denominator
  end

  {
    numerator: reduced_numerator,
    denominator: reduced_denominator
  }
end

def run -> array<{ original: array<int>, reduced: { denominator: int, numerator: int } }>
  [
    { original: [42, 56], reduced: reduce_fraction(42, 56) },
    { original: [13, 39], reduced: reduce_fraction(13, 39) },
    { original: [-150, 100], reduced: reduce_fraction(-150, 100) }
  ]
end

Output

Click Run example to see the result.

Code checks

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