Skip to content
Branch: master
Find file History
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.

Extended Euclidean Algorithm

This module implements the extended greatest common divider algorithm.

Pre: two integers a and b

Post: a tuple (x, y) where a*x + b*y = gcd(a, b) (bezout coefficients)

Pseudo Code:


for a :=131313131, b := 121212121, the benchmark ran in 6.338s:

BenchmarkGetCoeff        1       6255517486 ns/op
You can’t perform that action at this time.