Browse

algorithms

requests

all requests

users

all users

Learn

language

website

Create

ready to experiment?

use algorithmatic.com's in-browser integrated-development-environment here. The IDE offers syntax-highlighting, realtime validation, syntax-autocompletion, autocompletion for external-calls, interpreter and basic debugging.

Account

signin

algorithmatic.com uses OpenID - that means you don't need to register, probably you already have an OpenID, you just need to enable it.
Click here to sign in

Extended Euclidean

execute this algorithm

.. or ..

view and edit the code

Output

type in the input above and click 'Execute'
the result will be outputted here

Related Algorithms

+2

Greatest Common Divisor by guest 11 months and 2 weeks ago
+2

Prime Factorization by ANaimi 11 months and 2 days ago
+1

Euler's Totient Function by ANaimi 10 months and 3 weeks ago
+1

Modular Exponentiation by ANaimi 8 months and one week ago

Discussion

no comments yet

Version 1

The Extended Euclidean algorithm is a version of the Euclidean Algorithm; its input are two integers a and b and the algorithm computes their greatest common divisor (GCD) as well as integers x and y such that ax + by = gcd(a,b).

The output of the current implementation is an object with: X, Y, and GCD

See http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
Based on http://www.glasglow.com/e2/ex/Extended_Euclidean_algorithm.html

By ANaimi

11 months and 2 days ago

implementations

one version available

rated by

one user - list?

viewed by

4 users - list?

favorited by

0 users - list?

last activity