#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/math-fundamentals/gcd-lcm/fraction-addition-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/math-fundamentals/gcd-lcm/fraction-addition-implementation

Repovive

Fraction Addition - Implementation - GCD & LCM | Math Fundamentals | Repovive

Repovive.

Math Fundamentals18 sections · 842 units13h total

Open in Course

Fraction Addition - Implementation

The pseudocode

Here is the core addition and simplification logic:


function addFractions(fractions)
    num := 0
    denom := 1
    for each (a, b) in fractions
        num := num * b + a * denom
        denom := denom * b
        g := gcd(abs(num), denom)
        num := num / g
        denom := denom / g
    return num + "/" + denom

function gcd(a, b)
    while b != 0
        temp := b
        b := a mod b
        a := temp
    return a

Time: $O(n \log M)$ where $n$ is the number of fractions and $M$ is the max denominator. Space: $O(1)$ for the math operations.