GCD

Gcd

static int gcd(int a, int b)
    {
      if (b == 0)
        return a;
      return gcd(b, a % b); 
    }

Gcd

int gcd(int a,int b) {
	while (a&&b) a>b?a%=b:b%=a;
	return a+b;
}

Gcd

import math

a = 10
b = 8
answer = math.gcd(10, 8)
print(answer)

GCD

import java.util.Scanner;
public class   Euclid {
    static public void main(String[] argh){
        System.out.print("Enter two numbers: ");
        Scanner input = new Scanner(System.in);
        int a = input.nextInt();
        int b = input.nextInt();
        int TEMP = 0 ;
        int GCD = 0;
        int max = a>b?a:b;
        int min = a<b?a:b;
        while(min!=0){
            TEMP=(max%min);
            GCD = min ;
            min = TEMP;
        }
        System.out.print("("+GCD+")");
    }
}

Gcd

int gcd(int a,int b){
    if(b==0) return a;
    return gcd(b,a%b);
}

Gcd

int gcd(int a, int b) {
    while (b) b ^= a ^= b ^= a %= b;
    return a;
}

Similar codes

0 vote126 views1 answer
Executors java
Java
1 vote182 views1 answer
Android application manifest
Java
1 vote60 views2 answers
Equals ignore case in java
Java
0 vote163 views1 answer
How to return arraylist as array in java
Java
0 vote98 views2 answers
Scanner.nextInt stream api java
Java
0 vote116 views1 answer
How to et curent directory in java
Java
0 vote99 views1 answer
Matlab leslie eigenvalue java
Java
0 vote106 views1 answer
Java tamanho de um vetor
Java
1 vote100 views1 answer
Events that people think are unlikely but actually have high probability
Java
3 votes105 views1 answer
Padding a string with 0 in java
Java