Question

How to calculate the GCD (greatest common divisor) of two integers in Kotlin

Answer 1

fun gcd(a: Int, b: Int): Int {
    var num1 = a
    var num2 = b
    
    while (num2 != 0) {
        val temp = num2
        num2 = num1 % num2
        num1 = temp
    }
    
    return num1
}

fun main() {
    val number1 = 20
    val number2 = 12
    
    println("The GCD of $number1 and $number2 is ${gcd(number1, number2)}")
}


 
/*
run:

The GCD of 20 and 12 is 4
 
*/

 

70+ SQL courses for beginners and professionals