Jump to content

Greedy algorithm for Egyptian fractions: Difference between revisions

→‎{{header|ALGOL 68}}: typo in comment, doh!
(Added Algol 68)
(→‎{{header|ALGOL 68}}: typo in comment, doh!)
Line 48:
Uses Algol 68G's LONG LONG INT for large integers.
<lang algol68>BEGIN # compute some Egytian fractions #
PR precision 2000 PR # set the number of digits for LONG LOGLONG INT #
PROC gcd = ( LONG LONG INT a, b )LONG LONG INT:
IF b = 0 THEN
3,044

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.