Adde Euclid

Author: uschramme

Euclid/euclid.go

@@ -0,0 +1,27 @@
+package main
+
+import (
+"fmt"
+)
+
+// calculates
+func euclid(a, b int) int {
+if b == 0 {
+return a
+}
+return euclid(b, a%b) // recursive call
+}
+
+func main() {
+const text = "Least common multiple of"
+x, y := 65, 26
+fmt.Printf("%s %d and %d = %d\n", text, x, y, euclid(x, y))
+x, y = 224, 12
+fmt.Printf("%s %d and %d = %d\n", text, x, y, euclid(x, y))
+x, y = 1605, 24
+fmt.Printf("%s %d and %d = %d\n", text, x, y, euclid(x, y))
+x, y = 77, 392
+fmt.Printf("%s %d and %d = %d\n", text, x, y, euclid(x, y))
+x, y = 109, 15
+fmt.Printf("%s %d and %d = %d\n", text, x, y, euclid(x, y))
+}

README.md

@@ -7,3 +7,7 @@
 * GenericStack: a stack (LIFO collection) that can hold values of any type
 
  *Level: Beginner*
+
+* Euclid: a recursive algorithm to find the least common multiple
+
+ *Level: Beginner*