GCD, LCM & Extended Euclidean Algorithm Interactive Visualizer
The Euclidean Algorithm computes the Greatest Common Divisor (GCD) and Least Common Multiple (LCM) in O(log(min(a, b))) time, while Extended Euclid also solves ax + by = gcd(a, b) and finds modular inverses.
Study GCD, LCM & Extended Euclidean Algorithm Explanation · View Multi-Language Code · All Algorithms