Indonesia

Temukan G.C.D Menggunakan Rekursi. Java

Temukan G.C.D Menggunakan Rekursi. Java

#GCD #java

Java

xxxxxxxxxx
 
public class GCD {
​
    public static void main(String[] args) {
        int n1 = 366, n2 = 60;
        int hcf = hcf(n1, n2);
​
        System.out.printf("G.C.D of %d and %d is %d.", n1, n2, hcf);
    }
​
    public static int hcf(int n1, int n2)
    {
        if (n2 != 0)
            return hcf(n2, n1 % n2);
        else
            return n1;
    }
}

Java

contoh kode dan jawaban atas pertanyaan dalam bahasa pemrograman Java

Hot Network Questions

BeeCoder.ORG

open source code and examples

We have been online since 2021 and 1 millions of people around the globe have visited our website since then

More visitors every month