chrisvest-4clojure-solution66.clj

;; chrisvest's solution to http://4clojure.com/problem/66

;; Using Euclid's algorithm
(fn gcd [a b]
  (loop [dividend (max a b)
         divisor (min a b)
         quotient (quot dividend divisor)
         remainder (rem dividend divisor)]
    (if (zero? remainder)
      divisor
      (recur divisor
             remainder
             (quot divisor remainder)
             (rem divisor remainder)))))