Counting change recursive algorithm in Scala

README.md

Scala

Just a few interesting pieces of Scala code

countingChange.scala

/*
Write a recursive function that counts how many different ways you can make change for an amount, 
given a list of coin denominations. 
For example, there are 3 ways to give change for 4 if you have coins with denomination 1 and 2: 1+1+1+1, 1+1+2, 2+2.
*/
def countChange(money: Int, coins: List[Int]): Int = {

      def loop(money: Int, coins: List[Int]): Int = {
        if (money < 0 || coins.isEmpty ) 0
        else if (money == 0 ) 1
        else loop(money, coins.tail) + loop(money - coins.head, coins)
      }

      loop(money, coins)
    }