Scala programming (2) ---- maximum Common Divisor

GCD. Scala

Object GCD {def main (ARGs: array [String]) {println (gcd1 (ARGs (0 ). toint, argS (1 ). toint) println (gcd2 (ARGs (0 ). toint, argS (1 ). toint)} def gcd1 (X: int, Y: INT): Int = {var A = x var B = y while (! = 0) {var temp = A = B % a B = temp} B} def gcd2 (X: int, Y: INT ): int = {If (x = 0) y else gcd2 (Y % x, x )}}

$ Scalac GCD. Scala

$ Scala GCD 12 21

$ Scala GCD 21 12

 

Gcd1 adopts iteration, gcd2 adopts recursion, and gcd1 and gcd2 have basically been the simplest.

To make it easier to remember, express the thinking process:

 

Scala programming (2) ---- maximum Common Divisor