We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Functional Programming
  3. Ad Hoc
  4. Common Divisors
  5. Discussions

Common Divisors

  • NetkoNefarious
     + 0 comments

    I decided not to complicate and optimize, so I just used tail recursion:

        def noOfCd(x: Int, y: Int): Int = {
        def noOfCdRec(x: Int, y: Int, divisor: Int, result: Int = 0): Int = {
            if (divisor == 0) result
            else if (x % divisor == 0 && y % divisor == 0)
                noOfCdRec(x, y, divisor - 1, result + 1)
            else noOfCdRec(x, y, divisor - 1, result)
        }
        
        noOfCdRec(x, y, min(x, y))
    }