Programming challenge.

[dimon37]

Implement a program USING TAIL RECURSION that will answer the following question: Your inputs are a non-negative int representing a sum of money and an array of positive ints representing possible coin denominations. You need to tell how many different ways of producing the given sum of money using given denominations are. For example given 4 and (

Comments

[vgramagin]

На интервью в гугл готовишься? :-)

http://habrahabr.ru/post/109384/

[dimon37]

Нет, беру класс по Скале в coursera.org. Там tail recursion не требуется, это я просто ради интереса.