I decided to do some Project Euler problems using F#.
So here is my first one, Problem # 31. Nothing in this solution really shows off anything special about F# but you have to start somewhere ;)
1 2 3 4 5 6 7 8 9 | let rec combos amt (denoms:int list) = if amt = 0 then 1 elif denoms.IsEmpty || amt < 0 then 0 else combos (amt – denoms.Head) denoms + combos amt denoms.Tail printf "\n\nThe Anwer is: %i \n" (combos 200 [200;100;50;20;10;5;2;1]) |