Anonymous user
Greedy algorithm for Egyptian fractions: Difference between revisions
Greedy algorithm for Egyptian fractions (view source)
Revision as of 19:00, 31 May 2014
, 10 years agoUpdated D entry
(→{{header|J}}: ugh, something's going wrong with editing) |
(Updated D entry) |
||
Line 33:
arithmetic_rational: Rat = Rational;
Rat[] egyptian(Rat r) pure
typeof(return) result;
Line 43:
}
static enum mod = (in BigInt m, in BigInt n) pure
((m % n) + n) % n;
| |||