Greedy algorithm for Egyptian fractions: Difference between revisions
Content added Content deleted
| Line 502: | Line 502: | ||
'''Testing''': |
'''Testing''': |
||
<lang haskell>λ> :m Test.QuickCheck |
<lang haskell>λ> :m Test.QuickCheck |
||
λ> quickCheck (\n -> n == (sum $ |
λ> quickCheck (\n -> n == (sum $ egyptianFraction n)) |
||
+++ OK, passed 100 tests.</lang> |
+++ OK, passed 100 tests.</lang> |
||