extended euclidean algorithm to find x and y
int greatestCommonDivisor(int m, int n)
{
if(n == 0) return m;
return greatestCommonDivisor(n, m % n);
}extended euclidean algorithm to find x and y
int greatestCommonDivisor(int m, int n)
{
if(n == 0) return m;
return greatestCommonDivisor(n, m % n);
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
