Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Instant Grammar Checker - Correct all grammar errors and enhance your writing

Semrush - keyword research tool

Linux Foundation Training and Certification

Teach Your Child To Read

Disclosure: My content contains affiliate links.

32,307 questions

42,482 answers

573 users

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

1 Answer

0 votes
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
      
*/

 



Learn & Practice Python
with the most comprehensive set of 13 hands-on online Python courses
Start now


answered 6 days ago by avibootz
...