Question

How to calculate the GCD (greatest common divisor) of two numbers in Scala

Answer 1

object CalculateGCDOfTwoNumbers_Scala {
  def gcd(a: Int, b: Int): Int = {
    var gcd = 0
    var i = if (a < b) a else b

    while (i > 0) {
      if (a % i == 0 && b % i == 0) {
        gcd = i
        return gcd
      }
      i -= 1
    }

    gcd
  }

  def main(args: Array[String]): Unit = {
    val a = 12
    val b = 20

    println(s"The GCD (greatest common divisor) of $a and $b is: ${gcd(a, b)}")
  }
}

 
  
/*
run:
      
The GCD (greatest common divisor) of 12 and 20 is: 4
      
*/

 

70+ SQL courses for beginners and professionals