Euclidean Algorithm
eharetea

The Euclidean Algorithm is used to find the Greatest Common Divisor. Written in Scheme.

The Euclidean Algorithm is used to find the Greatest Common Divisor.

Date Created:Sunday September 28th, 2008 03:22 AM
Date Modified:Sunday September 28th, 2008 03:25 AM

(define (euclid a b)
   (if (= b 0)
       a
       (euclid b (modulo a b))
   )    
) 



Downloads:
Download: euclid.scm 94 B

Please login or Click Here to register for downloads
Creative Commons License
Euclidean Algorithm by Dan Lynch
is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 United States License
Based on a work at www.3daet.com
Permissions beyond the scope of this license may be available at http://www.3daet.com