Greedy algorithm for Egyptian fractions: Difference between revisions
Greedy algorithm for Egyptian fractions (view source)
Revision as of 10:02, 9 December 2023
, 5 months ago→{{header|Wren}}: Minor tidy
m (Minor edit to C++ code) |
m (→{{header|Wren}}: Minor tidy) |
||
Line 3,768:
{{libheader|Wren-big}}
We use the BigRat class in the above module to represent arbitrary size fractions.
<syntaxhighlight lang="
var toEgyptianHelper // recursive
| |||