Greedy algorithm for Egyptian fractions: Difference between revisions
Greedy algorithm for Egyptian fractions (view source)
Revision as of 17:28, 2 October 2018
, 5 years ago→{{header|Haskell}}
Line 502:
'''Testing''':
<lang haskell>λ> :m Test.QuickCheck
λ> quickCheck (\n -> n == (sum $
+++ OK, passed 100 tests.</lang>
| |||