Rosetta Code

Greatest common divisor: Difference between revisions

Page Discussion

Greatest common divisor (view source)

Revision as of 14:01, 26 November 2012

52 bytes added ,  11 years ago
→‎{{header|Clojure}} Improved formatting, moved comment outside code block, and minor wording improvement.
Line 402:
 
<lang lisp>(defn gcd
"(gcd a b) computes the greatest common divisor of a and b."
[a b]
(if (zero? b)
a
(recur b (mod a b)))) ; This is (gcd b (mod a b)), but with explicit tail call optimization.</lang>
 
That <code>recur</code> call is the same as <code>(gcd b (mod a b))</code>, but makes use of Clojure's explicit tail call optimization.
 
=={{header|COBOL}}==
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/51644"