Find minimum number of coins that make a given value: Difference between revisions

Content added Content deleted
(→‎{{header|Haskell}}: Allowed for denomination lists which are ill-sorted or incomplete.)
Line 120: Line 120:
| otherwise = Left "Incomplete denominations - lacks 1"
| otherwise = Left "Incomplete denominations - lacks 1"
where
where
go [] n = []
go _ 0 = []
go _ 0 = []
go (x : xs) n
go (x : xs) n