The Extended Euclidean Algorithm is an extension of the Euclidean Algorithm for finding the greatest common divisor (GCD) of two integers. In addition to finding the GCD, the Extended Euclidean Algorithm also computes the coefficients of Bézout's identity, which are integers x and y such that:

GCD(a,b)=ax+by

This algorithm is particularly useful in various areas, including number theory and cryptography.